1. 3-party message complexity is better than 2-party ones for proving lower bounds on the size of minimal nondeterministic finite automata;Adorna;J. Autom. Lang. Comb.,2002
2. Some descriptional complexity problems in finite automata theory;Adorna,2005
3. The average state complexity of rational operations on finite languages;Bassino;Internat. J. Found. Comput. Sci.,2010
4. Intersection and union of regular languages and state complexity;Birget;Inform. Process. Lett.,1992
5. Canonical regular expressions and minimal state graphs for definite events;Brzozowski,1962