Marais, LauretteVan Zijl, L2021-04-302021-04-302018-09Marais, L. & Van Zijl, L. 2018. The state complexity of language operations on XNFA-succinct unary regular languages. http://hdl.handle.net/10204/12002 .978-1-4503-6647-2https://doi.org/10.1145/3278681.3278684https://dl.acm.org/doi/10.1145/3278681.3278684http://hdl.handle.net/10204/12002Given two unary languages accepted by symmetric difference non-deterministic finite automata, we establish bounds on the state complexity of their union, intersection, relative complement and symmetric difference. For languages L1 and L2 accepted by minimal symmetric difference nondeterministic finite automata of size m and n respectively, we show that the state complexity of their union, intersection and relative complement has an upper bound of (2m - 1)(2n - 1).AbstractenXNFA-succinctUnary regular languagesDescriptional complexityLanguage operationsNondeterminismConference PresentationMarais, L., & Van Zijl, L. (2018). The state complexity of language operations on XNFA-succinct unary regular languages. http://hdl.handle.net/10204/12002Marais, Laurette, and L Van Zijl. "The state complexity of language operations on XNFA-succinct unary regular languages." <i>2018 Annual Conference of the South African Institute of Computer Scientists and Information Technologists (SAICSIT), Port Elizabeth, South Africa, 26-28 September 2018</i> (2018): http://hdl.handle.net/10204/12002Marais L, Van Zijl L, The state complexity of language operations on XNFA-succinct unary regular languages; 2018. http://hdl.handle.net/10204/12002 .TY - Conference Presentation AU - Marais, Laurette AU - Van Zijl, L AB - Given two unary languages accepted by symmetric difference non-deterministic finite automata, we establish bounds on the state complexity of their union, intersection, relative complement and symmetric difference. For languages L1 and L2 accepted by minimal symmetric difference nondeterministic finite automata of size m and n respectively, we show that the state complexity of their union, intersection and relative complement has an upper bound of (2m - 1)(2n - 1). DA - 2018-09 DB - ResearchSpace DP - CSIR J1 - 2018 Annual Conference of the South African Institute of Computer Scientists and Information Technologists (SAICSIT), Port Elizabeth, South Africa, 26-28 September 2018 KW - XNFA-succinct KW - Unary regular languages KW - Descriptional complexity KW - Language operations KW - Nondeterminism LK - https://researchspace.csir.co.za PY - 2018 SM - 978-1-4503-6647-2 T1 - The state complexity of language operations on XNFA-succinct unary regular languages TI - The state complexity of language operations on XNFA-succinct unary regular languages UR - http://hdl.handle.net/10204/12002 ER -21705