The word problem for finitary automaton groups
From MaRDI portal
Publication:6175091
DOI10.1007/978-3-031-34326-1_7arXiv2302.10670MaRDI QIDQ6175091
Maximilian Kotowsky, Jan Philipp Wächter
Publication date: 17 August 2023
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.10670
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
- The word and order problems for self-similar and automata groups
- Groups of intermediate growth: an introduction.
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
- An automaton group with undecidable order and Engel problems
- The conjugacy problem in automaton groups is not solvable.
- Groups defined by automata
- Bounded automata groups are co-ET0L
- On the complexity of the word problem for automaton semigroups and automaton groups
- An automaton group with \textsf{PSPACE}-complete word problem
- Groups and Automata: A Perfect Match
- Problems complete for deterministic logarithmic space
- Word Problems Solvable in Logspace
- On orbits and the finiteness of bounded automaton groups
- Complexity and Randomness in Group Theory
- The Compressed Word Problem for Groups
- THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
This page was built for publication: The word problem for finitary automaton groups
