Learn More
If L is a formal language, we deene A L (n) to be the number of states in the smallest deterministic nite automaton that accepts a language that agrees with L on all inputs of length n. This measure is called automaticity. In this paper, we rst study the closure properties of the class DPA of languages of deterministic polynomial automaticity, i.e., those(More)
  • 1