A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (Q3637215): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Shortest Synchronizing Strings for Huffman Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Synchronization Problem for Strongly Transitive Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all complete binary prefix codes have a self-synchronizing string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2729242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4171566 / 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: On synchronizing prefix codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization of Some DFA / rank
 
Normal rank
Property / cites work
 
Property / cites work: The road coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata Preserving a Chain of Partial Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / rank
 
Normal rank

Latest revision as of 17:59, 1 July 2024

scientific article
Language Label Description Also known as
English
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
scientific article

    Statements

    Identifiers