Indeed, the unrestricted(or type 0) grammars are equivalent to Turing Machines in the same regular grammars are equivalent to finite automata, and thus represent the most general kind of computation known. Context-free grammars also have a corresponding equivalent machine, called a pushdown automaton...
展开
评论
点赞