Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134): 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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6064523 / rank
 
Normal rank
Property / zbMATH Keywords
 
synchronization
Property / zbMATH Keywords: synchronization / rank
 
Normal rank
Property / zbMATH Keywords
 
automata
Property / zbMATH Keywords: automata / rank
 
Normal rank
Property / zbMATH Keywords
 
reset words
Property / zbMATH Keywords: reset words / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2175473110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing monotonic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum length of synchronizing words is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset Sequences for Monotonic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing finite automata on Eulerian digraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finding Reset Words in Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two Combinatorial Problems Arising from Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composition sequences for functions over a finite domain. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing automata preserving a chain of partial orders / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:42, 5 July 2024

scientific article
Language Label Description Also known as
English
Complexity of problems concerning reset words for cyclic and Eulerian automata
scientific article

    Statements

    Complexity of problems concerning reset words for cyclic and Eulerian automata (English)
    0 references
    0 references
    9 August 2012
    0 references
    0 references
    synchronization
    0 references
    automata
    0 references
    reset words
    0 references
    computational complexity
    0 references
    0 references