Ira Assent & Sebastian Seibert (2007):
An upper bound for transforming self-verifying automata into deterministic ones.
RAIRO-Theoretical Informatics and Applications-Informatique Théorique et Applications 41(3),
pp. 261–265,
doi:10.1051/ita:2007017.
John E. Hopcroft & Jeffrey D. Ullman (1990):
Introduction to Automata Theory, Languages, and Computation,
1st edition.
Addison-Wesley Longman Publishing Co., Inc.,
Boston, MA, USA.
Juraj Hromkovic & Georg Schnitger (1999):
On the Power of Las Vegas II. Two-Way Finite Automata.
In: JiríWiedermann, Peter van Emde Boas & Mogens Nielsen: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings,
Lecture Notes in Computer Science 1644.
Springer,
pp. 433–442,
doi:10.1007/3-540-48523-6_40.
Galina Jirásková & Giovanni Pighizzini (2011):
Optimal simulation of self-verifying automata by deterministic automata.
Information and Computation 209(3),
pp. 528 – 535.
Special Issue: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009),
doi:10.1016/j.ic.2010.11.017.
Laurette Marais & Lynette Van Zijl:
State Complexity of Unary SV-XNFA with Different Acceptance Conditions.
Submitted for publication.
Laurette Marais & Lynette van Zijl (2016):
Unary Self-verifying Symmetric Difference Automata.
In: Cezar Câmpeanu, Florin Manea & Jeffrey Shallit: Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings,
Lecture Notes in Computer Science 9777.
Springer,
pp. 180–191,
doi:10.1007/978-3-319-41114-9_14.
Brink Van der Merwe, Hellis Tamm & Lynette Van Zijl (2012):
Minimal DFA for Symmetric Difference NFA.
In: Martin Kutrib, Nelma Moreira & Rogério Reis: Descriptional Complexity of Formal Systems - 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings,
Lecture Notes in Computer Science 7386.
Springer,
pp. 307–318,
doi:10.1007/978-3-642-31623-4_24.
Harold S Stone (1973):
Discrete Mathematical Structures and their Applications.
Science Research Associates Chicago.
Jean Vuillemin & Nicolas Gama (2009):
Compact Normal Form for Regular Languages as Xor Automata.
In: Sebastian Maneth: Implementation and Application of Automata, 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009. Proceedings,
Lecture Notes in Computer Science 5642.
Springer,
pp. 24–33,
doi:10.1007/978-3-642-02979-0_6.
Lynette van Zijl (2005):
Magic numbers for symmetric difference NFAS.
Int. J. Found. Comput. Sci. 16(5),
pp. 1027–1038,
doi:10.1142/S0129054105003455.
Lynette van Zijl, John-Paul Harper & Frank Olivier (2000):
The MERLin Environment Applied to *-NFAs.
In: Sheng Yu & Andrei Paun: Implementation and Application of Automata, 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers,
Lecture Notes in Computer Science 2088.
Springer,
pp. 318–326,
doi:10.1007/3-540-44674-5_28.
eptcs@eptcs.org