Grammars [16 Apr 2008|01:38pm] I hate when I forget stuff that I've actively committed to memory at some point. In any event, I probably even posted this but trying to remember it yet again . . Grammar Languages Automaton Production rules (constraints) Type-0 Recursively enumerable Turing machine a -> b (no restrictions) Type-1 Context-sensitive Linear-bounded non-deterministic Turing machine aAb -> ayb Type-2 Context-free Non-deterministic pushdown automaton A -> y Type-3 Regular Finite state automaton A -> a and A -> aB post comment

navigation [ viewing | April 16th, 2008 ] [ go | previous day|next day ]