Polynomial Automaticity, Context-Free Languages, and Fixed Points of Morphism (Extended Abstract). - Ian Glaister; Jeffrey O. Shallit (MFCS, 1996)

A Lower Bound Technique for the Size of Nondeterministic Finite Automata. - Ian Glaister; Jeffrey O. Shallit (Inf. Process. Lett., 1996)

Automaticity III: Polynomial Automaticity and Context-Free Languages. - Ian Glaister; Jeffrey O. Shallit (Comput. Complex., 1998)