dfa_run

std.seq.dfa_run · Level L3

Run a deterministic finite automaton on a word: from the start state, one transition per symbol through dfa_step, then accept when the final state is accepting. accept is 1 or 0 per state. The empty word is accepted exactly when the start state is accepting.

accept(δ*(q₀, w))

Signature

dfa_run(delta: i64[q, a], start: i64[], accept: f64[q], word: i64[L]) → f64[], i64[]

Structure

The function as NOVA stores it: one box per input, operation and output, and arrows that carry values. A double border marks another library function this one runs — called once, or by Scan once per element; select it to open that function.

input
operation
constant
call
output

Verification

Signature proven by NOVA’s shape solver, for every size.
Equal to the reference q = start; for each symbol: q = delta[q, symbol]; accept[q] in exact rational arithmetic, on all 40 test cases.
All 80 float64 results are exact: the error is zero.
Interpreter and NumPy backend return bit-identical results.
At float32 too: the 40 test cases rounded to float32, and 40 of them exact, with zero error.

Accuracy in detail

correctly rounded (the float64 nearest the exact value): 100%
bit-equal to the NumPy formula in float64: 100%
largest error, in units in the last place: 0

Identity

Calls

dfa_step

Called by

—

sha256:74f5abe0024cb1e06edf103e01371375529923d8c17b4cfcf7767e00eaf1825d

The semantic hash of the graph. It changes when the program changes, and never when only its documentation does.

Control handle

Symbol: Ω:std.seq.dfa_run · Ω:dfa_run
Pins: sha256:1f030155f04f32e9acbd44b1ebd3fbe377f2f5b16d25e27b6e351c0b7afaedadthis graph and the 1 it reaches through calls
Evidence: sha256:fcfe2635862879679521302b11a49f968ac9bf163e812a6b62ff58583ff129d8the hash of its verification record
Needs: no capability: a pure function

Through NOVA’s control layer, the symbol launches this function only while the program still matches what it pins: a change to this graph, or to any graph it reaches, needs a migration first.