A context-free and a 1-counter geodesic language for a Baumslag-Solitar group

DOI10.1016/j.tcs.2005.03.026zbMath1142.68041arXivmath/0411166OpenAlexW2043281883MaRDI QIDQ557909

Murray J. Elder

Publication date: 30 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

context-free languageregular languageBaumslag-Solitar group\(G\)-automaton1-counter languagecounter languagelanguage of geodesics

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (6)

Thompson's group \(F\) is 1-counter graph automatic. ⋮ Markov semigroups, monoids and groups ⋮ Metric properties of Baumslag–Solitar groups ⋮ Limits of Baumslag-Solitar groups and dimension estimates in the space of marked groups. ⋮ Cone types and geodesic languages for lamplighter groups and Thompson's group \(F\). ⋮ Groups whose word problems are not semilinear

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On groups whose word problem is solved by a counter automaton.
• Groups, the theory of ends, and context-free languages
• Growth series for the group \(\langle x,y\mid x^{-1}yx=y^ l\rangle\)
• Growth Functions for Some Nonautomatic Baumslag-Solitar Groups
• Minimal almost convexity
• Minimal length normal forms for some soluble groups

This page was built for publication: A context-free and a 1-counter geodesic language for a Baumslag-Solitar group