Introduction to automata theory, languages, and computation, 1990. ,
DOI : 10.1145/568438.568455
Generalized nondeterminism and the succinct representation of regular languages, 1997. ,
Minimal DFA for Symmetric Difference NFA, Descriptional Complexity of Formal Systems: 14th International Workshop , DCFS 2012 Proceedings, pp.307-318, 2012. ,
DOI : 10.1007/978-3-642-31623-4_24
An upper bound for transforming self-verifying automata into deterministic ones, RAIRO-Theoretical Informatics and Applications- Informatique Théorique et Applications, pp.261-265, 2007. ,
DOI : 10.1109/T-C.1971.223108
On the power of Las Vegas II. Two-way finite automata, Automata, Languages and Programming: 26th International Colloquium , ICALP'99 Prague, pp.433-442, 1999. ,
Optimal simulation of self-verifying automata by deterministic automata, Special Issue: 3rd International Conference on Language and Automata Theory and Applications, pp.528-535, 2009. ,
DOI : 10.1016/j.ic.2010.11.017
Compact Normal Form for Regular Languages as Xor Automata, 14th International Conference Proceedings, pp.24-33, 2009. ,
DOI : 10.1016/j.tcs.2004.07.012
Discrete mathematical structures and their applications, Science Research Associates Chicago, 1973. ,
Applied modern algebra, 1978. ,
Pairs of Complementary Unary Languages with?????Balanced??? Nondeterministic Automata, Algorithmica, vol.109, issue.10, pp.571-587, 2010. ,
DOI : 10.1016/j.ipl.2009.06.005