STACS 2005

DOI10.1007/b106485zbMath1118.20301OpenAlexW4230940848MaRDI 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

zbMATH Keywords

Turing machinesfinitely generated groupsfinite automatavirtually Abelian groupsautomatic presentations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Automata and formal grammars in connection with logical questions (03D05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (16)

Learning pattern languages over groups ⋮ Lamplighter groups and automata ⋮ Word automatic groups of nilpotency class 2 ⋮ Unary Automatic Graphs: An Algorithmic Perspective ⋮ Finite automata presentable Abelian groups ⋮ Automatic presentations and semigroup constructions ⋮ Subalgebras of FA-presentable algebras. ⋮ Automatic Presentations for Cancellative Semigroups ⋮ FA-presentable groups and rings ⋮ Tree-Automatic Well-Founded Trees ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Cayley Automatic Groups and Numerical Characteristics of Turing Transducers ⋮ Where Automatic Structures Benefit from Weighted Automata ⋮ Learning Pattern Languages over Groups ⋮ Automaton semigroups ⋮ Automatic presentations for semigroups.

This page was built for publication: STACS 2005