1
Q
What are the P and NP complexity classes?
A
2
Q
When is a problem in NP?
A
3
Q
When is a formula satisfiable? Is this in P or NP.
In propositional logic
A
4
Q
What is NP-completeness?
A
5
Q
How can P=NP be proven?
A
6
Q
When is a problem co-NP?
A
7
Q
What are the complexity space classes PSpace and NPSpace?
A
Automata & Complexity
flashcards
Decks in class (24)
# Cards
-
Introduction2
-
Words & Languages13
-
Finite Automata17
-
(Regular) Grammars10
-
Regular Expressions3
-
Regular Languages5
-
Word Matching1
-
Automata Minimization3
-
Pumping Lemma3
-
Context-Free Languages7
-
Chomsky Normal Form5
-
CYK Parsing2
-
LL Parsing13
-
Pushdown Automata11
-
Pumping Lemma for Context-Free Languages2
-
Properties of Context-Free Languages4
-
Turing Machines12
-
Recursively Enumerable Languages7
-
Unrestricted Grammars3
-
Context-Sensitive Grammars & Linear Bounded Automata7
-
Chomsky Hierarchy1
-
Undeciability8
-
Complexity7
-
Exam Questions13
