The Labeling Graphs of Definite Automata
- 3 Downloads
Au algorithm of labeling a directed graph so that the obtained transition graph represents a definite automaton is described.
Unable to display preview. Download preview PDF.
- 1.R. A. Ishchenko, “Graphs of Group Automations,” Intellekt. SLstemy 21 (2), 111 (2017).Google Scholar
© Allerton Press, Inc. 2019