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