Regular Expressions and State Graphs for Automata
作者： R. McNaughton , H. Yamada
关键词:
摘要: Algorithms are presented for 1) converting a state graph describing the behavior of an automaton to regular expression same (section 2), and 2) into (sections 3 4). These algorithms justified by theorems, examples given. The first section contains brief introduction graphs regular-expression language.
philpapers.org
sci-hub.se 参考文章(1)
Irving M. Copi, Calvin C. Elgot, Jesse B. Wright, Realization of Events by Logical Nets Journal of the ACM. ,vol. 5, pp. 181- 196 ,(1958) , 10.1145/320924.320931