Abstract
Let G be a group and let φ:Σ⁎→G be a monoid homomorphism from the set of all strings Σ⁎ over some finite alphabet Σ onto the group G. The set Σ is then called a generating set for G and the language {1}φ−1⊆Σ⁎ is called the word problem of G with respect to the generating set Σ (via the homomorphism φ) and is denoted by W(G,Σ).We consider nine conditions that hold in each such language of the form W(G,Σ) and determine which combinations of these conditions are equivalent to the property of the language in question being the word problem of a group. We show that each of these nine conditions is decidable for the family of regular languages but that each is undecidable for the family of one-counter languages (the languages accepted by one-counter pushdown automata). We also show that the property of a language being the word problem of a group is undecidable for the family of one-counter languages but is decidable for the family of deterministic context-free languages (the languages accepted by deterministic pushdown automata).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.