Publication:5629545
From MaRDI portal
zbMath0223.94029MaRDI QIDQ5629545
Alica Piricka, Blanka Rosenauerová, Ján Černý
Publication date: 1971
Full work available at URL: https://eudml.org/doc/28384
68Q45: Formal languages and automata
Related Items
Les automates circulaires biaisés vérifient la conjecture de Černý, Unnamed Item, Synchronizing series-parallel deterministic finite automata with loops and related problems, A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices, On the Interplay Between Černý and Babai’s Conjectures, Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata, Unnamed Item, The relation between preset distinguishing sequences and synchronizing sequences, On primitivity of sets of matrices, Synchronization, Synchronizing finite automata with short reset words, La représentation ergodique d'un automate fini, Composition sequences for functions over a finite domain., An algorithm for road coloring, Slowly synchronizing automata with fixed alphabet size, Extremal synchronizing circular automata, Černý's conjecture and the road colouring problem, On the Synchronizing Probability Function and the Triple Rendezvous Time, On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata, Synchronizing Automata over Nested Words, Primitive Sets of Nonnegative Matrices and Synchronizing Automata, Unnamed Item, Notable trends concerning the synchronization of graphs and automata, Synchronizing Automata and the Černý Conjecture, Genetic Algorithm for Synchronization, Games with Opacity Condition
Cites Work
