✦ LIBER ✦

Methods of constructing universal tests for finite-state automata

✍ Scribed by V. A. Tverdokhlebov

Publisher: SP MAIK Nauka/Interperiodica
Year: 2005
Tongue: English
Weight: 149 KB
Volume: 66
Category: Article
ISSN: 0005-1179
DOI: 10.1007/s10513-005-0014-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposition method for structural synt

Decomposition method for structural synthesis of finite automata. I

✍ A. N. Melikhov; L. S. Bershtein; N. G. Topol'skii 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 505 KB

An O(n log n) implementation of the stan

An O(n log n) implementation of the standard method for minimizing n-state finite automata

✍ Norbert Blum 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 367 KB

A new algorithm of the state-minimizatio

A new algorithm of the state-minimization for the nondeterministic finite automata

✍ Melnikov, B. F. 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 189 KB

Method for construction of nonclassical

Method for construction of nonclassical equations of state

✍ Jeffrey R. Fox 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 396 KB

Algorithms for the inverse and a general

Algorithms for the inverse and a generalization of the state space approach to finite automata

✍ Chao-Chih Yang; Houkuan Huang 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 694 KB

An inductive method for constructing mim

An inductive method for constructing mimmal balanced collections of finite sets

✍ Bezalel Peleg 📂 Article 📅 1965 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB

B e z a l e l P e l e g Department of Mathematics The Hebrew U n i v e r s i t y of Jerusalem Jerusal en, I s r a e l and The U n i v e r s i t y of Michigan Department of Mathematics Ann Arbor. Michigan \*A l i s t is to a p p e a r in a f o r t h c o m i n g Rand M e m o r a n d u m by Shapley.