Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
(1708.06466)Abstract
Previously, self-verifying symmetric difference automata were defined and a tight bound of 2n-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 Ln accepted by a non-unary self-verifying symmetric difference nondeterministic automaton with n states, such that its equivalent minimal deterministic finite automaton has 2n-1 states. Also, given any SV-XNFA with n states, it is possible, up to isomorphism, to find at most another |GL(n,Z2)|-1 equivalent SV-XNFA.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.