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).
Reference:
Marais, L. & Van Zijl, L. 2018. The state complexity of language operations on XNFA-succinct unary regular languages. http://hdl.handle.net/10204/12002 .
Marais, L., & Van Zijl, L. (2018). The state complexity of language operations on XNFA-succinct unary regular languages. http://hdl.handle.net/10204/12002
Marais, Laurette, and L Van Zijl. "The state complexity of language operations on XNFA-succinct unary regular languages." 2018 Annual Conference of the South African Institute of Computer Scientists and Information Technologists (SAICSIT), Port Elizabeth, South Africa, 26-28 September 2018 (2018): http://hdl.handle.net/10204/12002
Marais L, Van Zijl L, The state complexity of language operations on XNFA-succinct unary regular languages; 2018. http://hdl.handle.net/10204/12002 .
2018 Annual Conference of the South African Institute of Computer Scientists and Information Technologists (SAICSIT), Port Elizabeth, South Africa, 26-28 September 2018
ResearchSpace
