Abstract:
Problems are considered of designing all and one (any) minimal diagnostic words for an automaton. General problems are formulated in search for optimal operators which cover these problems and algorithms of their solution are suggested. The findings lead to algorithms for design of minimal diagnostic words whereby the original final segments are restored and two-sided construction is performed. Complexity is compared of the suggested algorithms and their computer implementation is discussed.
Fulltext:
PDF file (1757 kB)