# State Complexity of Unary SV-XNFA with Different Acceptance Conditions

Abstract : Unary self-verifying symmetric difference automata were introduced in [1], with an upper bound of $O(2^{n})$ and lower bound of $2^{n-1}-1$ for state complexity. Implicit in the interpretation of self-verifying acceptance for the symmetric difference case was the assumption that no state could be both an accept state and a reject state. We present another interpretation of acceptance more aligned to the equivalence of symmetric difference automata to weighted automata over GF(2), where states that both accept and reject are allowed, and we give a tight bound of $2^{n-1}-1$ for state complexity for both interpretations of acceptance.
Document type :
Conference papers
Domain :
Complete list of metadata

https://hal.inria.fr/hal-01657002
Contributor : Hal Ifip <>
Submitted on : Wednesday, December 6, 2017 - 11:43:52 AM
Last modification on : Wednesday, December 6, 2017 - 2:13:33 PM

### File

440206_1_En_20_Chapter.pdf
Files produced by the author(s)

### Citation

Laurette Marais, Lynette Zijl. State Complexity of Unary SV-XNFA with Different Acceptance Conditions. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.250-261, ⟨10.1007/978-3-319-60252-3_20⟩. ⟨hal-01657002⟩

Record views