ResearchSpace

Unary self-verifying symmetric difference automata

Show simple item record

dc.contributor.author Marais, Laurette
dc.contributor.author Van Zijl, L
dc.date.accessioned 2017-09-19T08:31:08Z
dc.date.available 2017-09-19T08:31:08Z
dc.date.issued 2016-07
dc.identifier.citation Marais, L., and van Zijl, L. 2016. Unary Self-verifying Symmetric Difference Automata. In: Câmpeanu, C., Manea, F., Shallit, J. (eds) Descriptional Complexity of Formal Systems. DCFS 2016. Lecture Notes in Computer Science, vol 9777. Springer, Cham en_US
dc.identifier.isbn 978-3-319-41113-2
dc.identifier.uri http://link.springer.com/book/10.1007/978-3-319-41114-9
dc.identifier.uri http://hdl.handle.net/10204/9579
dc.description 18th International Workshop on Descriptional Complexity of Formal Systems, 5 - 8 July 2016, Bucharest, Romania. Due to copyright restrictions, the attached PDF file only contains the abstract of the full text item. For access to the full text item, please consult the publisher's website en_US
dc.description.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. en_US
dc.language.iso en en_US
dc.publisher Springer Nature en_US
dc.relation.ispartofseries Workflow;18755
dc.subject Nondeterministic finite automata en_US
dc.subject Unary SV-XNFA en_US
dc.title Unary self-verifying symmetric difference automata en_US
dc.type Conference Presentation en_US
dc.identifier.apacitation Marais, L., & Van Zijl, L. (2016). Unary self-verifying symmetric difference automata. Springer Nature. http://hdl.handle.net/10204/9579 en_ZA
dc.identifier.chicagocitation Marais, Laurette, and L Van Zijl. "Unary self-verifying symmetric difference automata." (2016): http://hdl.handle.net/10204/9579 en_ZA
dc.identifier.vancouvercitation Marais L, Van Zijl L, Unary self-verifying symmetric difference automata; Springer Nature; 2016. http://hdl.handle.net/10204/9579 . en_ZA
dc.identifier.ris TY - Conference Presentation AU - Marais, Laurette AU - Van Zijl, L AB - 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. DA - 2016-07 DB - ResearchSpace DP - CSIR KW - Nondeterministic finite automata KW - Unary SV-XNFA LK - https://researchspace.csir.co.za PY - 2016 SM - 978-3-319-41113-2 T1 - Unary self-verifying symmetric difference automata TI - Unary self-verifying symmetric difference automata UR - http://hdl.handle.net/10204/9579 ER - en_ZA


Files in this item

Thumbnail
Name: Marais_2016_ABSTR ...
Size: 120.0Kb
Format: PDF
View/Open

This item appears in the following Collection(s)

Show simple item record