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.
Type de document :
Communication dans un congrès
Giovanni Pighizzini; Cezar Câmpeanu. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10316, pp.250-261, 2017, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-60252-3_20〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01657002
Contributeur : Hal Ifip <>
Soumis le : mercredi 6 décembre 2017 - 11:43:52
Dernière modification le : mercredi 6 décembre 2017 - 14:13:33

Fichier

 Accès restreint
Fichier visible le : 2020-01-01

Connectez-vous pour demander l'accès au fichier

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Laurette Marais, Lynette Zijl. State Complexity of Unary SV-XNFA with Different Acceptance Conditions. Giovanni Pighizzini; Cezar Câmpeanu. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10316, pp.250-261, 2017, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-60252-3_20〉. 〈hal-01657002〉

Partager

Métriques

Consultations de la notice

21