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

Authors:
Murray Elder
Affiliations:
School of Mathematics and Statistics, University of St Andrews, North Haugh, St Andrews, Fife, Scotland
Venue:
Theoretical Computer Science
Year:
2005

Citing 5
Cited 0

Introduction to the Theory of Computation

Introduction to the Theory of Computation
Word Processing in Groups

Word Processing in Groups
The Accepting Power of Finite Automata over Groups

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
On groups whose word problem is solved by a counter automaton

Theoretical Computer Science
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Quantified Score

Hi-index	5.23

Visualization

Abstract

We give a language of unique geodesic normal forms for the Baumslag-Solitar group BS(1,2) that is context-free and 1-counter. We discuss the classes of context-free, 1-counter and counter languages, and explain how they are inter-related.