An automaton group with undecidable order and Engel problems (Q1693094): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963776259 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1710.09733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Computations in Automaton (Semi)groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5658240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Decidability of Engel’s Property for Automaton Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The word and order problems for self-similar and automata groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaton semigroup constructions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaton semigroups: new constructions results and examples of non-automaton semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5321501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5145148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amenable semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Freeness of automaton groups vs boundary dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the word problem for automaton semigroups and automaton groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutive one-way cellular automata and the finiteness problem for automaton groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automaton group with undecidable order and Engel problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Burnside's problem on periodic groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3442591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgroups of finitely presented groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nilpotency Problem of One-Dimensional Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of cellular automata: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and undecidability in cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cellular automata, tilings and (un)computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity and Immortality in Reversible Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaton semigroups: the two-state case. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbit automata as a new tool to attack the order problem in automaton groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The order problem and the power problem for free product sixth-groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolvable Problems in Groups With Solvable Word Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four Small Universal Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four states are enough! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small universal Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Computation-Universal Cellular Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2944019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The conjugacy problem in automaton groups is not solvable. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3864707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computable Numbers, with an Application to the Entscheidungsproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5265056 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:09, 14 July 2024

scientific article
Language Label Description Also known as
English
An automaton group with undecidable order and Engel problems
scientific article

    Statements

    An automaton group with undecidable order and Engel problems (English)
    0 references
    0 references
    11 January 2018
    0 references
    Mealy automaton
    0 references
    automaton group
    0 references
    order problem
    0 references
    Engel problem
    0 references
    cellular automaton
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references