1/39
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
Alphabet
Word
Language
e
|w|
w^R
palindrome
concatentation
a^n
subword
Deterministic Finite Automaton (DFA)
Q
∑
δ
s
F
A accepts w (DFA)
L(A) ⊆ ∑*
Regular
Nondeterministic Finite Automaton
A accepts w (NFA)
The Regular Operations
REG(∑)
Language of REG(∑)
The Pumping Lemma
Context-Free Grammar
v derivable from u in one step
v derivable from u
Language associated to CFG
Context-Free Language
Pushdown Automata
Configuration (PDA)
Yields in one step
Yields
A accepts w ∈ ∑*
L(A)
Turing Machine
Configuration (Turing Machine)
Semidecidable
Decidable