An effective version of Stallings' theorem in the case of context-free groups
DOI10.1007/3-540-56939-1_96zbMATH Open1422.20010OpenAlexW1541384626MaRDI QIDQ4630285FDOQ4630285
Authors: Géraud Sénizergues 
Publication date: 29 March 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-56939-1_96
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Thue and Post systems, etc. (03D03) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On torsion-free groups with infinitely many ends
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width
- The theory of ends, pushdown automata, and second-order logic
- Groups, the theory of ends, and context-free languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Groups of cohomological dimension one
- Title not available (Why is that?)
- Groups and NTS languages
- Actions of finite groups of graphs and related automorphisms of free groups
Cited In (9)
- Logical aspects of Cayley-graphs: the group case
- On the rational subsets of the free group
- The isomorphism problem for finite extensions of free groups is in PSPACE
- Automatic graphs and D0L-sequences of finite graphs
- Groups, graphs, languages, automata, games and second-order monadic logic
- The big-O problem
- READING OFF KUROSH DECOMPOSITIONS
- On groups presented by inverse-closed finite confluent length-reducing rewriting systems
- Context-Free Groups and Bass–Serre Theory
This page was built for publication: An effective version of Stallings' theorem in the case of context-free groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630285)
