4 ms·
For Chomsky, I would hazard finite state automata, BNF systems, and Turing machines. I might then mumble about number of tapes and time to recognize, and then s
by mjcohen 8y ago
For Chomsky, I would hazard finite state automata, BNF systems, and Turing machines. I might then mumble about number of tapes and time to recognize, and then stop.
- deleted 8y ago[deleted]
- JustSomeNobody 8y agoType 0, Type 1, Type 2 and Type 3 (aka: Type K grammars). Type 0 is an unrestricted grammar. Type 1 is a context sensitive grammar. Type 2 is a context free grammar. Type 3 is a regular grammar. For our (CS) purposes we typically use Type 2 and 3.