Abstract :
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.
Keywords :
Finite automata, finite state languages, regular expressions, right-linear grammar.; Convergence; Distributed computing; Iterative algorithms; Mathematics; Random variables; Finite automata, finite state languages, regular expressions, right-linear grammar.;
