Context-free pairs of groups. I: Context-free pairs and graphs

DOI10.1016/j.ejc.2012.03.011zbMath1279.68140arXiv0911.0090OpenAlexW2132847382WikidataQ39822789 ScholiaQ39822789MaRDI QIDQ444402

Wolfgang Woess, Tullio G. Ceccherini Silberstein

Publication date: 14 August 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.0090

zbMATH Keywords

graphscontext-free groupcontext-free pairsSchreier graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Graph theory (05C99)

Related Items (5)

The language of self-avoiding walks ⋮ Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions ⋮ Formulae and Asymptotics for Coefficients of Algebraic Functions ⋮ Groups, graphs, languages, automata, games and second-order monadic logic ⋮ Context-free pairs of groups. II: Cuts, tree sets, and random walks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Context-free pairs of groups. II: Cuts, tree sets, and random walks
• Automorphism groups of context-free graphs
• Groups, the theory of ends, and context-free languages
• Graphs and groups with tree-like properties
• The accessibility of finitely presented groups
• The theory of ends, pushdown automata, and second-order logic
• Ends of pairs of groups
• Vertex-transitive graphs and accessibility
• On the ends of pairs of groups
• On torsion-free groups with infinitely many ends
• Growth and ergodicity of context-free languages
• Finiteness Conditions on Subgroups and Formal Language Theory
• Ends of Group Pairs and Non-Positively Curved Cube Complexes
• The co-word problem for the Higman-Thompson group is context-free
• GROUPS WITH CONTEXT-FREE CO-WORD PROBLEM

This page was built for publication: Context-free pairs of groups. I: Context-free pairs and graphs