Synchronizing Automata Preserving a Chain of Partial Orders (Q3503892): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Developments in Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing generalized monotonic automata / 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: An extremal problem for two families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienting polygonal parts without sensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / 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: Reset words for commutative and solvable automata / 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: Q5387708 / rank
 
Normal rank

Latest revision as of 10:37, 28 June 2024

scientific article
Language Label Description Also known as
English
Synchronizing Automata Preserving a Chain of Partial Orders
scientific article

    Statements

    Synchronizing Automata Preserving a Chain of Partial Orders (English)
    0 references
    10 June 2008
    0 references
    deterministic finite automaton
    0 references
    synchronizing automaton
    0 references
    Černý conjecture
    0 references
    congruence on an automaton
    0 references
    weakly monotonic automaton
    0 references
    strongly connected automaton
    0 references
    0 references

    Identifiers