theorem
Theorem 19.3
Bounded access characterizes regularity
Theorem 19.3 (Bounded access characterizes regularity). For a language , the following are equivalent:
theorem
Bounded access characterizes regularity
Theorem 19.3 (Bounded access characterizes regularity). For a language , the following are equivalent: