1. Partial orders on words, minimal elements of regular languages, and state complexity;Birget;Theoretical Computer Science,1993
2. State complexity of basic operations on finite languages;Campeanu,1999
3. Tight lower bound for the state complexity of shuffle of regular languages;Campeanu;Journal of Automata, Languages and Combinatorics,2002
4. Chapter 5: state complexity of regular languages: finite versus infinite;Campeanu,2000
5. State complexity and proportional removals;Domaratzki;Journal of Automata, Languages and Combinatorics,2002