Automata and Formal Languages#
The theory of computation
Sections#
Resources#
[ y ]
11-11-2024Kay Lack. “Grammars, parsing, and recursive descent”.
https://math.mit.edu/~sipser/18404/
https://www.cs.odu.edu/~toida/nerzic/390teched/web_course.html
https://www.cs.ucr.edu/~jiang/cs150/slides4week3_AlgebraicLaws+PL.pdf
Figures#
Terms#
[ w ] Abstract Machine
[ w ] Alphabet
[ w ] Automata Theory
[ w ] Automaton
[ w ] Chomsky Hierarchy
[ w ] Combinatorics on words
[ w ] Finite-State Machine
[ w ] Formal Grammar
[ w ] Formal Language
[ w ] Kleene Star
[ w ] Mealy Machine
[ w ] Non Terminal Symbol
[ w ] Production Rule
[ w ] Pushdown Automaton
[ w ] Regular Language
[ w ] Symbol
[ w ] Terminal Symbol
[ w ] Turing Machine
[ w ] Abstract Machine
[ w ] Automata Theory
[ w ] Automaton
[ w ] Computation
[ w ] Finite-State Machine
[ w ] Hybrid Automaton
[ w ] Model of Computation
[ w ] State
[ w ] Timed Automaton
[ w ] Turing Machine