Laurette Marais (Department of Computer Science, Stellenbosch University and Meraka Institute, CSIR) |
Lynette van Zijl (Department of Computer Science, Stellenbosch University) |

Previously, self-verifying symmetric difference automata were defined and a tight bound of 2^n-1-1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n at least 2, there is a regular language L_n accepted by a non-unary self-verifying symmetric difference nondeterministic automaton with n states, such that its equivalent minimal deterministic finite automaton has 2^n-1 states. Also, given any SV-XNFA with n states, it is possible, up to isomorphism, to find at most another |GL(n,Z_2)|-1 equivalent SV-XNFA. |

Published: 21st August 2017.

ArXived at: http://dx.doi.org/10.4204/EPTCS.252.16 | bibtex | |

Comments and questions to: eptcs@eptcs.org |

For website issues: webmaster@eptcs.org |