Chomsky_hierarchy

 

Grammar Languages Automaton Production rules (constraints)
Type-0 Recursively enumerable Turing machine \alpha \rightarrow \beta (no restrictions)
Type-1 Context-sensitive Linear-bounded non-deterministic Turing machine \alpha A \beta \rightarrow \alpha \gamma \beta
Type-2 Context-free Non-deterministic pushdown automaton A \rightarrow \gamma
Type-3 Regular Finite state automaton A \rightarrow a
and
A \rightarrow aB

 

regular 包含right-regular和left-regular，上图是right-regular

 

http://en.wikipedia.org/wiki/Chomsky_hierarchy

posted on 2014-10-20 18:34  katago  阅读(370)  评论(0)  编辑  收藏  举报