%0 Conference Proceedings
%T Unary Self-verifying Symmetric Difference Automata
%+ Stellenbosch University
%+ Council for Scientific and Industrial Research [Pretoria] (CSIR)
%A Marais, Laurette
%A Zijl, Lynette, Van
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
%C Bucharest, Romania
%Y Cezar Câmpeanu
%Y Florin Manea
%Y Jeffrey Shallit
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-9777
%P 180-191
%8 2016-07-05
%D 2016
%R 10.1007/978-3-319-41114-9_14
%Z Computer Science [cs]Conference papers
%X 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 $$\mathcal {L}_{n\ge 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.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01633957/document
%2 https://inria.hal.science/hal-01633957/file/416473_1_En_14_Chapter.pdf
%L hal-01633957
%U https://inria.hal.science/hal-01633957
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-LNCS-9777
%~ IFIP-WG1-2