CSCI3130 · 1
Chapter outline · Regular languages
Definitions and theorem statements recorded in the web, in note order, with the exact proof steps behind their recorded connections.
0 of 5 public sections have indexed statements. This outline covers only those statements, not every theorem in the chapter. Recorded connections are still being reviewed.
Distinguishability and minimal deterministic automata
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Finite automata, regular expressions, and the pumping lemma
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Decision problems for deterministic finite automata
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
The regular-language pumping lemma
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Homomorphisms and regular languages
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.