Abstract
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).
This research is supported by the Natural Sciences and Engineering Research Council of Canada grants OGP0041630.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Berstel and M. Morcrette, “Compact representation of patterns by finite automata”, Pixim 89: L’Image Numérique á Paris, André Gagalowicz, ed., Hermes, Paris, 1989, pp.387–395.
J.A. Brzozowski and E. Leiss, “On Equations for Regular Languages, Finite Automata, and Sequential Networks”, Theoretical Computer Science 10 (1980) 19–35.
A.K. Chandra, D.C. Kozen, L.J. Stockmeyer, “Alternation”, Journal of the ACM 28 (1981) 114–133.
H.K. Cheung, An Efficient Implementation Method for Alternating Finite Automata, MSc Project Paper, Dept. of Computer Science, Univ. of Western Ontario, Sept. 1996.
Olivier Coudert, “Two-Level Logic Minimization: An Overview”, Integration,The VLSI Journal 17 (1994) 97–140.
K. Culik II and J. Kari, “Image Compression Using Weighted Finite Automata”, Computer and Graphics, vol. 17, 3, (1993) 305–313.
A. Fellah, Alternating Finite Automata and Related Problems. PhD dissertation, Kent State Univ. 1991.
A. Fellah, H. Jürgensen, and S. Yu, “Constructions for Alternating Finite Automata”, Intern J. Comp. Math. 35 (1990) 117–132.
M. Fowler and K. Scott, UML Distilled, Addison-Wesley, 1997.
L. Guo, K. Salomaa, and S. Yu, “Synchronization Expressions and Languages”, Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing (1994) 257–264
D. Harel, “Executable Object Modeling with Statecharts”, July 1997, IEEE Computer, pps. 31–42.
D. Harel, “Statecharts: a visual formalism for complex systems”, Science of Computer Programming8 (1987) 231–274.
H.B. Hunt, D.J. Rosenkrantz, and T.G. Szymanski, “On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages”, Journal of Computer and System Sciences 12 (1976) 222–268.
T. Jiang and B. Ravikumar, “Minimal NFA Problems are Hard”, SIAM Journal on Computing 22 (1993) 1117–1141.
D. Raymond and D. Wood, Release Notes for Grail Version 2.5, Dept. of Computer Science, Univ. of Western Ontario, 1996.
J. Rumbaugh, M. Blaha, W. Premerlani, F. Eddy, W. Lorensen, Object-Oriented Modeling and Design, Prentice-Hall, 1991.
K. Salomaa, X. Wu and S. Yu, “Efficient Implementation of Regular Languages Using R-AFA”, Proceedings of the Second International Workshop on Implementing Automata. Lecture Notes in Computer Science 1436, Springer, pps.176–184.
L. Stockmeyer and A. Meyer, “Word problems requiring exponential time (preliminary report)”, Proceedings of the 5th ACM Symposium on Theory of Computing, (1973) 1–9.
D. Wood, Theory of Computation, John Wiley & Sons, New York, 1987.
X. Wu, “Implementation of Regular Languages by Using R-AFA”, Master’s Project Report, The Department of Computer Science, Univ. of Western Ontario, 1997.
S. Yu, “Regular Languages”, Chapter 2, Handbook of Formal Languages, Vol. 1, Springer 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huerter, S., Salomaa, K., Wu, X., Yu, S. (1999). Implementing Reversed Alternating Finite Automaton (r-AFA) Operations. In: Champarnaud, JM., Ziadi, D., Maurel, D. (eds) Automata Implementation. WIA 1998. Lecture Notes in Computer Science, vol 1660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48057-9_6
Download citation
DOI: https://doi.org/10.1007/3-540-48057-9_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66652-3
Online ISBN: 978-3-540-48057-0
eBook Packages: Springer Book Archive