This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Generation of Right-Linear Grammars from Regular Expressions
April 1971 (vol. 20 no. 4)
pp. 472-473
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.
Index Terms:
Finite automata, finite state languages, regular expressions, right-linear grammar.
Citation:
A.R. Patel, "Generation of Right-Linear Grammars from Regular Expressions," IEEE Transactions on Computers, vol. 20, no. 4, pp. 472-473, April 1971, doi:10.1109/T-C.1971.223271
Usage of this product signifies your acceptance of the Terms of Use.