Extremal binary PFAs in a Černý family (Q832924): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lower Bounds for Synchronizing Word Lengths in Partial Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for two families of sets / 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: An improvement to a recent upper bound for synchronizing words of finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / rank
 
Normal rank

Latest revision as of 12:06, 28 July 2024

scientific article
Language Label Description Also known as
English
Extremal binary PFAs in a Černý family
scientific article

    Statements