A129403
Minimal number of edges in e-free non-deterministic finite automata (NFA) for regular expression c_1?c_2?…c_n?.
offset: 1
codomain: ℕ
The OEIS sequence has the tags “hard” and/or “more” and few known values. It is likely that the Lean code is not representing the actual sequence, even though it coincides in the known values.
Declarations
Section titled “Declarations”- A129403computable