Author:Marais, Laurette; Van Zijl, LDate:Sep 2017Previously, self-verifying symmetric difference automata were defined and a tight bound of 2^n-1-1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n at least 2, there is a regular ...Read more
Author:Ngassam, EK; Kourie, DG; Watson, BWDate:Oct 2010Previous work on implementations of FA-based string recognizers suggested a range of implementation strategies (and therefore, algorithms) aiming at improving their performance for fast string recognition. However, an efficient exploitation ...Read more
Author:Seotsanyana, MDate:Jan 2010In this paper, a critical review on temporal logic motion planning is presented. The review paper aims to address the following problems: (a) In a realistic situation, the motion planning problem is carried out in real-time, in a dynamic, ...Read more