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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
