scientific article; zbMATH DE number 3354928

Cited in

(38)

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
Synchronizing words for real-time deterministic pushdown automata (extended abstract)
Sync-maximal permutation groups equal primitive permutation groups
On the synchronizing probability function and the triple rendezvous time. New approaches to Černý's conjecture
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
scientific article; zbMATH DE number 7228447 (Why is no real title available?)
Notable trends concerning the synchronization of graphs and automata
Synchronizing Automata and the Černý Conjecture
Genetic Algorithm for Synchronization
Games with Opacity Condition
Les automates circulaires biaisés vérifient la conjecture de Černý
Synchronizing series-parallel deterministic finite automata with loops and related problems
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
Attainable values of reset thresholds
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
scientific article; zbMATH DE number 4185044 (Why is no real title available?)
Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach
Completely distinguishable automata and the set of synchronizing words
Synchronizing Boolean networks asynchronously
Binary and circular automata having maximal state complexity for the set of synchronizing words
On the smallest synchronizing terms of finite tree automata
Reset thresholds of transformation monoids
On the smallest synchronizing terms of finite tree automata
Completely distinguishable automata and the set of synchronizing words
A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
The relation between preset distinguishing sequences and synchronizing sequences
On primitivity of sets of matrices
Synchronization

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5629545)