196
edits
(added archive links to prevent against link rot) |
(added Chomsky's hierarchy) |
||
## Regular Automata
### Limited state, can only read input once
## Chomsky's hierarchy[[File:Chomsky-hierarchy.svg|alt=Image of Chomsky's hierarchy|thumb|331x331px|Chomsky's hierarchy]]
### Regular expressions are at the bottom of this pyramid
### Context-free, Context-sensitive, and Recursively enumerable expressions sit above regular expressions, in that order
### Turing machines above all of those (not pictured)
### Regular expression cannot replace your programming language
### Some regular language implementation decide languages that '''aren't regular!''' >:(
|