proposition
Proposition 19.1
Basic access laws
Proposition 19.1 (Basic access laws). For every language over a finite alphabet:
exists;
is nondecreasing in ; and
if has a reachable -state DFA, then .
proposition
Basic access laws
Proposition 19.1 (Basic access laws). For every language over a finite alphabet:
exists;
is nondecreasing in ; and
if has a reachable -state DFA, then .