Ian Glaister

Learn More
If L is a formal language, we define $ A_L(n) $ to be the number of states in the smallest deterministic finite automaton that accepts a language which agrees with L on all inputs of length no more than n. This measure is called automaticity. In this paper, we first study the closure properties of the class DPA of languages of deterministic polynomial(More)
  • 1