linear bounded automaton
| Linear-bounded automaton | context-sensitive grammar | Chomsky hierarchy | Turing Machine |
| recursively enumerable | Tetris complete | limited series | formal language theory |
Y'know, if you log in, you can write something here, or contact authors directly on the site. Create a New User if you don't already have an account.