Languages and their representations
Grammars
Finite automata and regular grammars
Context-free grammars
Pushdown automata
Turing machines
Turing machines: the halting problem, type 0 languages
Linear bounded automata and context-sensitive languages
Operations on languages
Time- and tap-bounded Turing machines
Time and space bounds for recognizing context-free languages
Deterministic pushdown automata
Stack automata
Decidability
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4