Bounded automata groups are co-ET0L

DOI10.1007/978-3-030-13435-8_6zbMath1425.68275arXiv1811.10157OpenAlexW2952059091MaRDI QIDQ2278264

Murray J. Elder, Alex Bishop

Publication date: 4 December 2019

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

zbMATH Keywords

formal language theoryET0L languagebounded automata groupcheck-stack pushdown automatonco-word problem

Mathematics Subject Classification ID

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

Related Items (4)

The complexity of solution sets to equations in hyperbolic groups ⋮ EDT0L solutions to equations in group extensions ⋮ The word problem for finitary automaton groups ⋮ Unnamed Item

This page was built for publication: Bounded automata groups are co-ET0L