Hotz-isomorphism theorems in formal language theory

DOI10.1051/ita/1989230100291zbMath0665.68059OpenAlexW187695367MaRDI QIDQ3816994

Volker Diekert, Axel Möbus

Publication date: 1989

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92321

zbMATH Keywords

undecidabilityfinitely presentable groupHotz groupequivalence of context-free grammarsHotz isomorphismHotz monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

Word problems of groups: formal languages, characterizations and decidability ⋮ CONTEXT-FREE GROUPS AND THEIR STRUCTURE TREES

Cites Work

• Unnamed Item
• Unnamed Item
• Homomorphic images of sentential form languages defined by semi-Thue systems
• Investigations on Hotz groups for arbitrary grammars
• Eine neue Invariante für kontextfreie Sprachen
• On the Hotz group of a context-free grammar
• On some variants of the Ehrenfeucht conjecture

This page was built for publication: Hotz-isomorphism theorems in formal language theory