Asymptotic estimate of the length of a diagnostic word for a finite automaton
From MaRDI portal
Publication:3893317
DOI10.1007/BF01069104zbMath0447.68058MaRDI QIDQ3893317
Publication date: 1980
Published in: Cybernetics (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA, Lower Bounds for Synchronizing Word Lengths in Partial Automata, Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach, On the smallest synchronizing terms of finite tree automata, Theory of general linear automata, Some results concerning careful synchronization of partial automata and subset synchronization of DFA's, Careful synchronization of partial deterministic finite automata, Using SAT solvers for synchronization issues in non-deterministic automata, Preset Distinguishing Sequences and Diameter of Transformation Semigroups, Primitive Sets of Nonnegative Matrices and Synchronizing Automata
Cites Work