Geodesic
Properties of systems of defining relations for automata
Diskretnaya Matematika, Tome 16 (2004) no. 4, pp. 79-87

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DM_2004_16_4_a7,
     author = {I. S. Grunskii and A. S. Senchenko},
     title = {Properties of systems of defining relations for automata},
     journal = {Diskretnaya Matematika},
     pages = {79--87},
     publisher = {mathdoc},
     volume = {16},
     number = {4},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2004_16_4_a7/}
}
TY  - JOUR
AU  - I. S. Grunskii
AU  - A. S. Senchenko
TI  - Properties of systems of defining relations for automata
JO  - Diskretnaya Matematika
PY  - 2004
SP  - 79
EP  - 87
VL  - 16
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2004_16_4_a7/
LA  - ru
ID  - DM_2004_16_4_a7
ER  - 
%0 Journal Article
%A I. S. Grunskii
%A A. S. Senchenko
%T Properties of systems of defining relations for automata
%J Diskretnaya Matematika
%D 2004
%P 79-87
%V 16
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2004_16_4_a7/
%G ru
%F DM_2004_16_4_a7
I. S. Grunskii; A. S. Senchenko. Properties of systems of defining relations for automata. Diskretnaya Matematika, Tome 16 (2004) no. 4, pp. 79-87. http://geodesic.mathdoc.fr/item/DM_2004_16_4_a7/