Abstract
We investigate self-verifying nondeterministic finite automata, in the case of unary symmetric difference nondeterministic finite automata (SV-XNFA). We show that there is a family of languages Ln≤2 which can always be represented non-trivially by unary SV-XNFA.We also consider the descriptional complexity of unary SV-XNFA, giving an upper and lower bound for state complexity.
Cite
CITATION STYLE
Marais, L., & Van Zijl, L. (2016). Unary self-verifying symmetric difference automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9777, pp. 180–191). Springer Verlag. https://doi.org/10.1007/978-3-319-41114-9_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
