Skip to content

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.

1.1

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.

1.2

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.

1.3

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.

1.4

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.

1.5

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.

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details