ON GROUPS WHICH ARE SYNTACTIC MONOIDS OF DETERMINISTIC CONTEXT-FREE LANGUAGES

DOI10.1142/S0218196704001876zbMath1066.20038MaRDI QIDQ4824702

Claas E. Röver

Publication date: 1 November 2004

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

wreath productscontext-free languagessyntactic monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Extensions, wreath products, and other compositions of groups (20E22) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Groups, the theory of ends, and context-free languages
• The accessibility of finitely presented groups
• The theory of ends, pushdown automata, and second-order logic

This page was built for publication: ON GROUPS WHICH ARE SYNTACTIC MONOIDS OF DETERMINISTIC CONTEXT-FREE LANGUAGES