Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$

DOI10.1090/tran/6963zbMath1364.20015arXiv1405.0982OpenAlexW3105273758MaRDI QIDQ2960427

James Belk, Collin Bleak

Publication date: 9 February 2017

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

transducerBrin-Thompson groupsreversible Turing machinerational groupundecidable torsion problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Simple groups (20E32) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Dynamical systems involving transformations and group actions with special properties (minimality, distality, proximality, expansivity, etc.) (37B05) Word problems, etc. in computability and recursion theory (03D40) Infinite automorphism groups (20B27)

Related Items (14)

Freeness of automaton groups vs boundary dynamics ⋮ A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group ⋮ The Group of Reversible Turing Machines ⋮ Higher dimensional generalizations of the Thompson groups ⋮ Some isomorphism results for Thompson-like groups \(V_n(G)\) ⋮ Orbit automata as a new tool to attack the order problem in automaton groups ⋮ Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness ⋮ An automaton group with undecidable order and Engel problems ⋮ A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group ⋮ A description of \(\operatorname{Aut} (d V_n)\) and \(\operatorname{Out} (d V_n)\) using transducers ⋮ Rational embeddings of hyperbolic groups ⋮ The polynomial endomorphisms of graph algebras ⋮ On the asynchronous rational group ⋮ The word and order problems for self-similar and automata groups

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 Brin-Thompson groups \(sV\) are of the type \(\text F_\infty\).
• Presentations for the higher-dimensional Thompson groups \(nV\).
• Metric properties of higher-dimensional Thompson's groups.
• On the baker's map and the simplicity of the higher dimensional Thompson groups \(nV\).
• On Burnside's problem on periodic groups
• On topological dynamics of Turing machines
• Universality of a reversible two-counter machine
• An algebraic method for public-key cryptography
• Higher dimensional Thompson groups.
• Presentations of higher dimensional Thompson groups.
• Conjugacy and dynamics in Thompson's groups.
• Implementing Computations in Automaton (Semi)groups
• The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
• Isomorphism versus commensurability for a class of finitely presented groups
• Some Unsolvable Problems about Elements and Subgroups of Groups.
• Periodicity and Immortality in Reversible Computing
• On Non-Computable Functions
• Cohomological finiteness properties of the Brin–Thompson–Higman groups 2V and 3V
• THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
• Logical Reversibility of Computation
• Deciding stability and mortality of piecewise affine dynamical systems

This page was built for publication: Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$