Topics: Formal Language Theory : Regular Languages
Bookmark or ShareA grammar is regular if and only if its rules are of the form X -> a or X -> aY, where X and Y are nonterminals and a is a terminal. Regular languages can be accepted by finite state automata.
Help build the largest human-edited directory on the web.