Synchronised automata
From MaRDI portal
Recommendations
Cited in
(19)- Synchronized tree automata
- Synchronizing finite automata on Eulerian digraphs.
- Extremal synchronizing circular automata
- Černý's conjecture and the road colouring problem
- Synchronizing times for k-sets in automata
- Synchronizing sequences for road colored digraphs
- Experiments with Synchronizing Automata
- Experiments on Synchronizing Automata
- The Černý conjecture and 1-contracting automata
- scientific article; zbMATH DE number 3864504 (Why is no real title available?)
- scientific article; zbMATH DE number 177164 (Why is no real title available?)
- scientific article; zbMATH DE number 1346363 (Why is no real title available?)
- Les automates circulaires biaisés vérifient la conjecture de Černý
- Extremal minimality conditions on automata
- Locally strongly transitive automata in the Černý conjecture and related problems
- Completely distinguishable automata and the set of synchronizing words
- Synchronization of finite automata
- Monoids of upper triangular matrices over the Boolean semiring
- Efficiently computing the minimum rank of a matrix in a monoid of zero-one matrices
This page was built for publication: Synchronised automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365563)