✦ LIBER ✦

Proof of an achievable bound on the length of a conditional diagnostic experiment for a finite automaton

✍ Scribed by I. K. Rystsov

Publisher: Springer US
Year: 1976
Tongue: English
Weight: 283 KB
Volume: 12
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01070013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on the length of the diagnostic w

Bounds on the length of the diagnostic word of a finite automaton

✍ M. N. Sokolovskii 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 455 KB

Asymptotic estimate of the length of a d

Asymptotic estimate of the length of a diagnostic word for a finite automaton

✍ I. K. Rystsov 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 410 KB

Estimation of the length of the shortest

Estimation of the length of the shortest diagnostic word for a finite automaton

✍ I. K. Rystsov 📂 Article 📅 1979 🏛 Springer US 🌐 English ⚖ 658 KB

On the attainable upper bound of the len

On the attainable upper bound of the length of the minimal adjustment experiment for a Moore automaton

✍ A. M. Bogomolov; I. S. Grunskii 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 119 KB

An Upper Bound for the Length of a Finit

An Upper Bound for the Length of a Finite-Dimensional Algebra

✍ Christopher J Pappacena 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Let F be a field, and let A be a finite-dimensional F-algebra. Write d s dim A, F and let e be the largest degree of the minimal polynomial for any a g A. Define Ž . ' the function f d, e s e 2dr e y 1 q 1r4 q er2 y 2. We prove that, if S is Ž . any finite generating set for A as an F-algebra, the

In extremal combinatorial problem associ

In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton

✍ A. A. Klyachko; I. K. Rystsov; M. A. Spivak 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 783 KB