scientific article; zbMATH DE number 3605922
From MaRDI portal
Publication:4171566
zbMATH Open0389.68036MaRDI QIDQ4171566FDOQ4171566
Publication date: 1978
Title of this publication is not available (Why is that?)
Formal languages and automata (68Q45) Theory of error-correcting codes and error-detecting codes (94B99) Semigroups in automata theory, linguistics, etc. (20M35)
Cited In (26)
- Groups synchronizing a transformation of non-uniform kernel
- State complexity of the set of synchronizing words for circular automata and automata over binary alphabets
- Les automates circulaires biaisés vérifient la conjecture de Černý
- On synchronizing unambiguous automata
- Circular automata synchronize with high probability
- Representation theory of finite semigroups, semigroup radicals and formal language theory
- Estimation of the length of reset words for automata with simple idempotents
- Title not available (Why is that?)
- Sync-maximal permutation groups equal primitive permutation groups
- In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
- Binary and circular automata having maximal state complexity for the set of synchronizing words
- Reset words for commutative and solvable automata
- Černý's conjecture and group representation theory
- Rank of a finite automaton
- Algebraic synchronization criterion and computing reset words
- Synchronizing groups and automata
- Simplicity of augmentation submodules for transformation monoids
- The Synchronization Problem for Strongly Transitive Automata
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
- Cerny's conjecture for automata with simple idempotents
- Černý's conjecture and the road colouring problem
- The Černý conjecture and 1-contracting automata
- The Černý conjecture for one-cluster automata with prime length cycle
- Almost optimal bound of recurrent word length for regular automata
- On incomplete and synchronizing finite sets
- Shortest directing words of nondeterministic directable automata
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 Q4171566)
