Statecharts: A visual formalism for complex systems
Science of Computer Programming
Object-oriented modeling and design
Object-oriented modeling and design
Alternating finite automata and related problems
Alternating finite automata and related problems
SIAM Journal on Computing
Two-level logic minimization: an overview
Integration, the VLSI Journal
Journal of the ACM (JACM)
Theory of Computation: A Primer
Theory of Computation: A Primer
Efficient Implementation of Regular Languages Using R-AFA
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On the equivalence, containment, and covering problems for the regular and context-free languages
Journal of Computer and System Sciences
| Hi-index | 0.00 |
In [17], we introduced a bit-wise representation of r-AFA, which greatly improved the space efficiency in representing regular languages. We also described our algorithms and implementation methods for the union, intersection, and complementation of r-AFA. However, our direct algorithms for the star, concatenation, and reversal operations of r-AFA would cause an exponential expansion in the size of resulting r-AFA for even the average cases. In this paper, we will design new algorithms for the star, concatenation, and reversal operations of r-AFA based on the bit-wise representation introduced in [17]. Experiments show that the new algorithms can significantly reduce the state size of the resulting r-AFA. We also show how we have improved the DFA-to-AFA transformation algorithm which was described in [17]. The average run time of this transformation using the modified algorithm has improved significantly (by 97 percent).