On a subclass of context-free groups
From MaRDI portal
Publication:3978768
DOI10.1051/ita/1991250302551zbMath0751.68040OpenAlexW11603665MaRDI QIDQ3978768
Publication date: 25 June 1992
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92392
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (12)
Word problems of groups: formal languages, characterizations and decidability ⋮ The (nested) word problem ⋮ On groups whose word problem is solved by a counter automaton. ⋮ Algebraic and context-free subsets of subgroups ⋮ On generalized conjugacy and some related problems ⋮ On the word problem for free products of semigroups and monoids ⋮ On a kind of Fatou property of context-free groups ⋮ The loop problem for Rees matrix semigroups. ⋮ Group presentations, formal languages and characterizations of one- counter groups ⋮ New results on the prefix membership problem for one-relator groups ⋮ Automatic presentations for semigroups. ⋮ Groups Whose Word Problem is a Petri Net Language
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Groups and NTS languages
- Groups, the theory of ends, and context-free languages
- The accessibility of finitely presented groups
- Theory of traces
- Monadic Thue systems
- Groups and Simple Languages
- Finiteness Conditions on Subgroups and Formal Language Theory
- Sur une propriété d'itération des langages algébriques déterministes
- Regularity and Related Problems for Deterministic Pushdown Automata
- A regularity test for pushdown machines
- A Note on Free Groups
This page was built for publication: On a subclass of context-free groups
