proposition

Proposition 19.1

Basic access laws

Proposition 19.1 (Basic access laws). For every language over a finite alphabet:

  1. aL(N)a_L(N) exists;

  2. aL(N)a_L(N) is nondecreasing in NN; and

  3. if LL has a reachable kk-state DFA, then aL(N)≤k−1a_L(N)\le k-1.