### Automata Theory (index)

- The Halting Problem
- Playing with mathematical machines
- Turing Machine Tricks
- Computer Science, Math, and Languages
- Regular Languages
- Nondeterminism in Finite State Machines
- Context Free Languages
- Context Sensitive Languages
- Level 0, recursive and recursively enumerable languages
- Busy Beavers
- The Minsky Machine
- A minsky machine to play with

## 0 Comments:

Post a Comment

<< Home