On the complexity of the word problem for automaton semigroups and automaton groups (Q2363312): 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: W2557440256 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1611.09541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Computations in Automaton (Semi)groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth of Schreier graphs of automaton groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The word problem in Hanoi Towers groups / 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: Automaton semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups and semigroups defined by colorings of synchronizing automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric approach to (semi)-groups defined by automata via dual transducers. / 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: THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE / 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: Groups of intermediate growth: an introduction. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5464461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SELF-SIMILAR INVERSE SEMIGROUPS AND SMALE SPACES / rank
 
Normal rank
Property / cites work
 
Property / cites work: INVERSE SEMIGROUPS OF PARTIAL AUTOMATON PERMUTATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5092326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2944019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of forced enumeration for nondeterministic automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:40, 14 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of the word problem for automaton semigroups and automaton groups
scientific article

    Statements

    On the complexity of the word problem for automaton semigroups and automaton groups (English)
    0 references
    0 references
    0 references
    0 references
    13 July 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    automaton groups
    0 references
    automaton semigroups
    0 references
    word problem
    0 references
    PSpace
    0 references
    0 references
    0 references