Regular Expressions and State Graphs for Automata
- 1 March 1960
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-9 (1) , 39-47
- https://doi.org/10.1109/tec.1960.5221603
Abstract
Algorithms are presented for 1) converting a state graph describing the behavior of an automaton to a regular expression describing the behavior of the same automaton (section 2), and 2) for converting a regular expression into a state graph (sections 3 and 4). These algorithms are justified by theorems, and examples are given. The first section contains a brief introduction to state graphs and the regular-expression language.Keywords
This publication has 1 reference indexed in Scilit:
- Realization of Events by Logical NetsJournal of the ACM, 1958