Methods of constructing universal tests for finite-state automata.
Saved in:
| Title: | Methods of constructing universal tests for finite-state automata. |
|---|---|
| Authors: | Tverdokhlebov, V.1 |
| Source: | Automation & Remote Control. Jan2005, Vol. 66 Issue 1, p139-147. 9p. |
| Subjects: | Sequential machine theory, Machine theory, Proof theory, Algorithms, Mathematical models |
| Abstract: | Proves the existence of a unique common experiment for recognition of automata in all families satisfying several conditions. Main tasks of technical diagnosis; Universal tests of automata; Reduction of the universal test length. |
| Database: | Engineering Source |
Be the first to leave a comment!
