ConceptAI & ML
Finite automata
A small subset of the Turing machine which is really just kind of like a small finite going from state to state.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
State transitions1Turing machine1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
7- Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA
- Introduction, Finite Automata, Regular Expressions
- Regular Pumping Lemma, Conversion of FA to Regular Expressions
- CF Pumping Lemma, Turing Machines
- TM Variants, Church-Turing Thesis
- Strange Gaps in the Local Time Hierarchy
- Computational Models: Turing Machines
Connections
13The lectures that define it or assume it, and the concepts next to it.
Concepts5
Lectures8
- Super Turing Computing: Foundations for Aware and Ever-Adapting Systems
- Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA
- Introduction, Finite Automata, Regular Expressions
- Regular Pumping Lemma, Conversion of FA to Regular Expressions
- CF Pumping Lemma, Turing Machines
- TM Variants, Church-Turing Thesis