|
This article is cited in 4 scientific papers (total in 4 papers)
Properties of systems of defining relations for automata
I. S. Grunskii, A. S. Senchenko
Abstract:
We suggest a canonical system of defining relations for finite everywhere defined outputless automata. We construct a procedure to pass from an arbitrary finite system of defining relations to a canonical one and, as a corollary, a procedure to check whether a finite system of pairs of words is a defining system for a given
automaton or not. We also suggest a procedure to pass from a traversal of all arcs of the automaton graph to a system of defining relations and vice versa.
Received: 24.01.2004
Citation:
I. S. Grunskii, A. S. Senchenko, “Properties of systems of defining relations for automata”, Diskr. Mat., 16:4 (2004), 79–87; Discrete Math. Appl., 14:6 (2004), 593–601
Linking options:
https://www.mathnet.ru/eng/dm177https://doi.org/10.4213/dm177 https://www.mathnet.ru/eng/dm/v16/i4/p79
|
Statistics & downloads: |
Abstract page: | 451 | Full-text PDF : | 232 | References: | 57 | First page: | 1 |
|