### 8 papers:

- CIAA-J-2013-BalkanskiBKW15 #complexity #on the #word
- On the state complexity of partial word DFAs (EB, FBS, MK, BJW), pp. 2–12.
- CIAA-2013-BalkanskiBKW #word
- Partial Word DFAs (EB, FBS, MK, BJW), pp. 36–47.
- CIAA-2012-JiraskovaM #complexity #on the
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (GJ, TM), pp. 229–239.
- CIAA-2006-RoyC #finite #infinity #model checking
- A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems (SR, BC), pp. 277–278.
- CIAA-2005-GarciaRCA #learning #question
- Is Learning RFSAs Better Than Learning DFAs? (PG, JR, AC, GIA), pp. 343–344.
- SEFM-2004-Roy #finite #infinity #using #verification
- Symbolic Verification of Infinite Systems using a Finite Union of DFAs (SR), pp. 56–66.
- CIAA-2000-Watson #algorithm
- Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski (BWW), pp. 311–317.
- WIA-1998-Watson #algorithm #performance
- A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs (BWW), pp. 121–132.