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
 
Importer (talk | contribs)
Changed an Item
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

Revision as of 02:18, 30 June 2023

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