### 10 papers:

- CIAA-2014-KoH #nondeterminism
- Left is Better than Right for Reducing Nondeterminism of NFAs (SKK, YSH), pp. 238–251.
- LATA-2013-MerweFG #difference #symmetry
- Counting Minimal Symmetric Difference NFAs (BvdM, MF, JG), pp. 419–430.
- ICALP-v1-2006-Kapoutsis
- Small Sweeping 2NFAs Are Not Closed Under Complement (CAK), pp. 144–156.
- CIAA-J-2004-ChamparnaudCP05
- Brute force determinization of nfas by means of state covers (JMC, FC, TP), pp. 441–451.
- ICALP-2005-HromkovicS
- NFAs With and Without epsilon-Transitions (JH, GS), pp. 385–396.
- CIAA-2004-ChamparnaudCP
- Brute Force Determinization of NFAs by Means of State Covers (JMC, FC, TP), pp. 80–89.
- CIAA-2004-Zijl #difference #symmetry
- Magic Numbers for Symmetric Difference NFAs (LvZ), pp. 333–334.
- CIAA-2003-Zijl #regular expression
- Succinct Descriptions of Regular Languages with Binary +-NFAs (LvZ), pp. 72–82.
- CIAA-2001-Zijl #generative #random
- Random Number Generation with +-NFAs (LvZ), pp. 263–273.
- CIAA-2000-ZijlHO
- The MERLin Environment Applied to *-NFAs (LvZ, JPH, FO), pp. 318–326.