Introduction Flashcards
(2 cards)
1
Q
What is the idea of universal computing? What are Turing machines?
A
2
Q
What are the three different types of automata? What are they used for?
A
Automata & Complexity (24 decks)
- Introduction
- Words & Languages
- Finite Automata
- (Regular) Grammars
- Regular Expressions
- Regular Languages
- Word Matching
- Automata Minimization
- Pumping Lemma
- Context-Free Languages
- Chomsky Normal Form
- CYK Parsing
- LL Parsing
- Pushdown Automata
- Pumping Lemma for Context-Free Languages
- Properties of Context-Free Languages
- Turing Machines
- Recursively Enumerable Languages
- Unrestricted Grammars
- Context-Sensitive Grammars & Linear Bounded Automata
- Chomsky Hierarchy
- Undeciability
- Complexity
- Exam Questions
