Pages that link to "Item:Q1936130"

The following pages link to The conjugacy problem in automaton groups is not solvable. (Q1936130):

Displaying 16 items.

• Some topics in the dynamics of group actions on rooted trees. (Q641942) (← links)
• On the structure theory of partial automaton semigroups (Q786010) (← links)
• Orbit automata as a new tool to attack the order problem in automaton groups (Q891470) (← links)
• An automaton group with undecidable order and Engel problems (Q1693094) (← links)
• Permutive one-way cellular automata and the finiteness problem for automaton groups (Q2011658) (← links)
• Corrigendum to: ``Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness'' (Q2130510) (← links)
• Key agreement based on automaton groups (Q2178747) (← links)
• Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness (Q2190041) (← links)
• On a class of poly-context-free groups generated by automata (Q2700958) (← links)
• An automaton group with \textsf{PSPACE}-complete word problem (Q2701072) (← links)
• Implementing Computations in Automaton (Semi)groups (Q2914713) (← links)
• Finitely Generated Semiautomatic Groups (Q3188266) (← links)
• Automaton (Semi)groups: Wang Tilings and Schreier Tries (Q4613554) (← links)
• On orbits and the finiteness of bounded automaton groups (Q4957772) (← links)
• (Q5091811) (← links)
• THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE (Q5410736) (← links)