Pages that link to "Item:Q2960427"

The following pages link to Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$ (Q2960427):

Displayed 14 items.

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