Abstract
We investigate concatenation theories for some classes of one-symbol languages. These classes can be the class of all languages, the class of regular languages, or the class of finite languages. We prove that all such theories are undecidable. The last two theories are algorithmically equivalent to elementary arithmetic. The first is equivalent to second order arithmetic.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
