1. Detecting equality of variables in programs;Alpern,1988
2. Myths and facts about the efficient implementation of finite automata and lexical analysis;Brouwer,1998
3. Canonical regular expressions and minimal state graphs for definite events;Brzozowski,1962
4. Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings;Daciuk,2003
5. The automatic generation of fast lexical analysers;Heuring;Software—Practice and Experience,1986