Author:Marais, Laurette; Van Zijl, LDate:May 2022Unary self-verifying symmetric difference automata have a known tight bound of 2n-1-1 for their state complexity. We now consider the non-unary case and show that, for every n=2, there is a regular language Ln accepted by a non-unary ...Read more
Author:Marais, Laurette; Van Zijl, LDate:Sep 2018Given 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 ...Read more