scientific article; zbMATH DE number 3354928
From MaRDI portal
Publication:5629545
zbMath0223.94029MaRDI QIDQ5629545
Alica Piricka, Blanka Rosenauerová, Ján Černý
Publication date: 1971
Full work available at URL: https://eudml.org/doc/28384
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (34)
Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach ⋮ Synchronizing words and monoid factorization, yielding a new parameterized complexity class? ⋮ Unnamed Item ⋮ La représentation ergodique d'un automate fini ⋮ An algorithm for road coloring ⋮ Completely distinguishable automata and the set of synchronizing words ⋮ Synchronizing Boolean networks asynchronously ⋮ On primitivity of sets of matrices ⋮ Binary and circular automata having maximal state complexity for the set of synchronizing words ⋮ On the smallest synchronizing terms of finite tree automata ⋮ Les automates circulaires biaisés vérifient la conjecture de Černý ⋮ On the Interplay Between Černý and Babai’s Conjectures ⋮ Synchronizing Automata and the Černý Conjecture ⋮ Synchronization ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time ⋮ Genetic Algorithm for Synchronization ⋮ The relation between preset distinguishing sequences and synchronizing sequences ⋮ Slowly synchronizing automata with fixed alphabet size ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata ⋮ Synchronizing finite automata with short reset words ⋮ Synchronizing Automata over Nested Words ⋮ Extremal synchronizing circular automata ⋮ Games with Opacity Condition ⋮ Černý's conjecture and the road colouring problem ⋮ Attainable Values of Reset Thresholds ⋮ Synchronizing words for real-time deterministic pushdown automata (extended abstract) ⋮ Sync-maximal permutation groups equal primitive permutation groups ⋮ Primitive Sets of Nonnegative Matrices and Synchronizing Automata ⋮ Composition sequences for functions over a finite domain. ⋮ Notable trends concerning the synchronization of graphs and automata ⋮ Unnamed Item ⋮ Synchronizing series-parallel deterministic finite automata with loops and related problems
Cites Work
This page was built for publication:
