Directory of Regular Languages Resources
Home > Computers > Computer Science > Theoretical > Formal Language Theory > Regular Languages
A 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. Regular languages may also be defined using regular expressions, which consist of sets of string over a finite alphabet under the operations of union, concatenation and Kleene closure.
Resources in This Category
-
Grammars for Regular Languages
http://www.seas.upenn.edu/~cit596/notes/dave/reggram1.html
A series of pages showing that a regular grammar is either a right-linear or left-linear grammar. -
Regular Expression
http://mathworld.wolfram.com/RegularExpression.html
The formal definition of regular expressions, also used to define regular languages. -
Regular Expression
http://en.wikipedia.org/wiki/Regular_expression
A Wikipedia article on regular expressions with an informal discussion, a formal definition and examples. -
Regular Language
http://en.wikipedia.org/wiki/Regular_language
Basic definitions of regular languages, how they are generated, closure properties, and comparison with context free languages. -
Regular Languages
http://dingo.sbs.arizona.edu/~langendoen/LING501/LING501regular.htm
This site gives a recursive definition of the class of regular languages, discusses its closure properties and gives examples. -
Regular Languages
http://www.dcs.napier.ac.uk/~andrew/co42010/kentucky/languages/reg-lang.pdf
This short chapter proves that regular languages are those accepted by finite state automata.
Related Categories
Home > Computers > Computer Science > Theoretical > Formal Language Theory > Regular Languages
Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us
