STACS 2005
From MaRDI portal
Publication:5710719
DOI10.1007/b106485zbMath1118.20301MaRDI QIDQ5710719
Richard M. Thomas, Graham Oliver
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Turing machines; finitely generated groups; finite automata; virtually Abelian groups; automatic presentations
68Q45: Formal languages and automata
20F05: Generators, relations, and presentations of groups
03D05: Automata and formal grammars in connection with logical questions
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
Related Items
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES, Tree-Automatic Well-Founded Trees, Word automatic groups of nilpotency class 2, Subalgebras of FA-presentable algebras., Finite automata presentable Abelian groups, FA-presentable groups and rings, Automaton semigroups, Automatic presentations for semigroups., Learning pattern languages over groups, Automatic presentations and semigroup constructions, Lamplighter groups and automata, Cayley Automatic Groups and Numerical Characteristics of Turing Transducers, Learning Pattern Languages over Groups, Where Automatic Structures Benefit from Weighted Automata, Unary Automatic Graphs: An Algorithmic Perspective, Automatic Presentations for Cancellative Semigroups