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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/978-3-030-81508-0_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3187086614 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:06, 28 July 2024

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

    Statements

    Extremal binary PFAs in a Černý family (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2022
    0 references
    finite automata
    0 references
    synchronization
    0 references
    Černý conjecture
    0 references

    Identifiers