Abstract
This paper considers questions relating formal languages to word problems of groups with a particular emphasis on the decidability of some problems that arise. We investigate the decidability of certain natural conditions that characterize word problems for various classes of languages and we then turn our attention to the question of a language actually being a word problem. We show that this is decidable for the classes of regular and deterministic context-free languages but undecidable for the one-counter languages.
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.
