ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-09

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Epsilon closure and word transitions on three states

Example

Let $Q = {p, q, r}$ , $Σ = {a, b}$ , start $p$ , and $F = {r}$ , where the displayed states and letters are distinct. Specify the entire transition table by

State	$ε$	$a$	$b$
$p$	${q}$	$\emptyset$	$\emptyset$
$q$	$\emptyset$	${q, r}$	$\emptyset$
$r$	$\emptyset$	$\emptyset$	${r}$

Then $ECl ({p}) = {p, q}$ and $ECl (\emptyset) = \emptyset$ . The state sets from $p$ on $ε, a, a a, a b, b, a b a$ are, respectively, ${p, q}, {q, r}, {q, r}, {r}, \emptyset, \emptyset$ . Thus $a, a a, a b$ are accepted and $ε, b, a b a$ are rejected.

Facts & Assumptions

Given: The nine table entries, start $p$ , and final set ${r}$ above; write $E = ECl$ .

[F1]

Epsilon closure is finite saturation; the empty-word value is the initial closure and each next letter takes a successor union followed by closure. Acceptance tests nonempty intersection with the final set (Epsilon-NFAs, finite epsilon closure, and extended word transition).

Verification

1.1

The table gives a subset of $Q$ at each of its nine state/label pairs, so the transition is total on the required domain. The finite sets, start and finals meet the epsilon-NFA requirements. Starting from ${p}$ , saturation adds $q$ in one stage and adds nothing thereafter, since neither $q$ nor $r$ has an epsilon successor. Thus $E ({p}) = {p, q}$ ; more generally $E (T) = T \cup {q}$ if $p \in T$ , and $E (T) = T$ otherwise. In particular $E (\emptyset) = \emptyset$ , $E ({q, r}) = {q, r}$ and $E ({r}) = {r}$ .

givenF1

2.1

The empty-word value is $\hat{δ} (p, ε) = {p, q}$ . For $a$ , the successor union from this set is $δ (p, a) \cup δ (q, a) = \emptyset \cup {q, r} = {q, r}$ , already closed; hence $\hat{δ} (p, a) = {q, r}$ . For $b$ , the corresponding union is $\emptyset \cup \emptyset = \emptyset$ , so $\hat{δ} (p, b) = \emptyset$ .

step 1.1givenF1

3.1

After $a$ the set is ${q, r}$ . Its $a$ -successor union is ${q, r} \cup \emptyset = {q, r}$ , and its $b$ -successor union is $\emptyset \cup {r} = {r}$ . Both are closed, giving $\hat{δ} (p, a a) = {q, r}$ and $\hat{δ} (p, a b) = {r}$ . From ${r}$ the $a$ -successor union is empty, so $\hat{δ} (p, a b a) = \emptyset$ .

step 1.1step 2.1givenF1

4.1

The sets for $a, a a, a b$ each contain $r$ , whereas the sets for $ε, b, a b a$ do not. Intersecting them with $F = {r}$ gives ${r}$ in the first three cases and $\emptyset$ in the other three, proving every asserted acceptance and rejection.

step 2.1step 3.1F1given∎

Source

The witness is original to this example. The calculation uses the closure and word-transition rules of Gallier, Definitions 3.6–3.7, pp. 30–32, via the local interface.

Depends on

Epsilon-NFAs, finite epsilon closure, and extended word transition

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

Jean Gallier, Introduction to the Theory of Computation (2018), §§3.3–3.5 (standard reference, not scraped)
Alfred Aho, COMS W3261 Lecture 3, §§1–2 (standard reference, not scraped)