Properties of systems of defining relations for automata
Diskretnaya Matematika, Tome 16 (2004) no. 4, pp. 79-87
Cet article a éte moissonné depuis 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},
year = {2004},
volume = {16},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/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/
[1] Sorkin Yu. I., “Teoriya opredelyayuschikh sootnoshenii dlya avtomatov”, Problemy kibernetiki, 9 (1961), 45–69
[2] Grunskii I. S., “Opredelyayuschie sootnosheniya dlya avtomatov”, Tretya Algebraicheskaya konferentsiya v Ukraine, Izd-vo Sumskogo ped. un-ta, Sumy, 2001, 159–160
[3] Bogomolov A. M., Salii V. N., Algebraicheskie osnovy teorii diskretnykh sistem, Nauka, Moskva, 1997 | MR | Zbl
[4] Kudryavtsev V. B., Aleshin S. V., Podkolzin A. S., Vvedenie v teoriyu avtomatov, Nauka, Moskva, 1985 | MR
[5] Grunskii I. S., Senchenko A. S., “Kanonicheskaya sistema opredelyayuschikh sootnoshenii dlya avtomatov”, Trudy IPMM NAN Ukrainy, 7, 2002, 58–63 | MR