Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1142/s0129054123450053 / rank
Normal rank
 
Property / cites work
 
Property / cites work: COLLAPSING WORDS: A PROGRESS REPORT / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing monotonic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing generalized monotonic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Between primitive and 2-transitive: synchronization and its friends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics, Words and Symbolic Dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3653240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4794042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely Reachable Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of completely reachable automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary completely reachable automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5208363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Černý conjecture and 1-contracting automata / 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: On the Interplay Between Černý and Babai’s Conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5208375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5249242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of the set of synchronizing words for circular automata and automata over binary alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset complexity and completely reachable automata with simple idempotents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing finite automata on Eulerian digraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Černý's conjecture and the road colouring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reset Complexity of Ideal Languages Over a Binary Alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4266486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups generated by a group and an idempotent / 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: Estimation of the length of reset words for automata with simple idempotents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-based testing of reactive systems. Advanced lectures. / 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: THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Černý conjecture for one-cluster automata with prime length cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modifying the Upper Bound on the Length of Minimal Synchronizing Word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing Automata and the Černý Conjecture / 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: Synchronization of finite automata / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1142/S0129054123450053 / rank
 
Normal rank

Latest revision as of 18:11, 30 December 2024

scientific article; zbMATH DE number 7749893
Language Label Description Also known as
English
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
scientific article; zbMATH DE number 7749893

    Statements

    Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (English)
    0 references
    0 references
    0 references
    0 references
    13 October 2023
    0 references
    deterministic finite automaton
    0 references
    complete reachability
    0 references
    strongly connected graph
    0 references
    tree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references