Issue No. 04 - April (1971 vol. 20)
A.R. Patel , Comput. Ctr. Univ. Conn.
A finite state language can be represented by a regular expression or a right-linear grammar. An algorithm to generate a right-linear grammar for regular expression is presented. The algorithm can be implemented on computers. A Snobol 4 program for this algorithm was written for the IBM 360/65 with success.
Finite automata, finite state languages, regular expressions, right-linear grammar.
A. Patel, "Generation of Right-Linear Grammars from Regular Expressions," in IEEE Transactions on Computers, vol. 20, no. , pp. 472-473, 1971.