Abstract
This paper deals with one of possibilities of use of nondeterministic finite automaton (NFA) — simulation of NFA using the method called bit parallelism. After a short presentation of the basic simulation method, the bit parallelism is presented on one of the pattern matching problems. Then a flexibility of the bit parallelism is demonstrated by a simulation of NFAs for other pattern matching problems.
Partially supported by the GAČR grants 201/98/1155, 201/01/1433, and 201/01/P082.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
K. Abrahamson. Generalized string matching. SI AM J. Comput., 16(6):1039–1051, 1987.
R. A. Baeza-Yates and G. H. Gonnet. A new approach to text searching. Commun. ACM, 35(10):74–82, 1992.
R. A. Baeza-Yates and G. Navarro. A fast heuristic for approximate string matching. In N. Ziviani, R. Baeza-Yates, and K. Guimarães, editors, Proceedings of the 3rd South American Workshop on String Processing, pages 47–63, Recife, Brazil, 1996. Carleton University Press.
R. A. Baeza-Yates and G. Navarro. A faster algorithm for approximate string matching. In D. S. Hirschberg and E. W. Myers, editors, Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, number 1075 in Lecture Notes in Computer Science, pages 1–23, Laguna Beach, CA, 1996. Springer-Verlag, Berlin.
R. A. Baeza-Yates and G. Navarro. Multiple approximate string matching. In F. K.H. A. Dehne, A. Rau-Chaplin, J.-R. Sack, and R. Tamassia, editors, Proceedings of the 5th Workshop on Algorithms and Data Structures, number 1272 in Lecture Notes in Computer Science, pages 174–184, Halifax, Nova Scotia, Canada, 1997. Springer-Verlag, Berlin.
R. A. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127–158, 1999.
B. Dömölki. An algorithm for syntactical analysis. Computational Linguistics, (3):29–46, 1964.
J. Holub, C. S. Iliopoulos, B. Melichar, and L. Mouchard. Distributed string matching using finite automata. In R. Raman and J. Simpson, editors, Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms, pages 114–128, Perth, WA, Australia, 1999.
J. Holub and B. Melichar. Implementation of nondeterministic finite automata for approximate pattern matching. In J.-M. Champarnaud, D. Maurel, and D. Ziadi, editors, Proceedings of the 3rd International Workshop on Implementing Automata’98, number 1660 in Lecture Notes in Computer Science, pages 92–99, Rouen, France, 1999. Springer-Verlag, Berlin.
J. Holub. Reduced nondeterministic finite automata for approximate string matching. In J. Holub, editor, Proceedings of the Prague Stringologic Club Workshop’ 96, pages 19–27, Czech Technical University, Prague, Czech Republic, 1996. Collaborative Report DC-96-10.
J. Holub. Approximate string matching in text. Master’s thesis, Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic, February 1996.
J. Holub. Simulation of NFA in approximate string and sequence matching. In J. Holub, editor, Proceedings of the Prague Stringology Club Workshop’ 97, pages 39–46, Czech Technical University, Prague, Czech Republic, 1997. Collaborative Report DC-97-03.
J. Holub. Simulation of Nondeterministic Finite Automata in Pattern Matching. Ph. D. Thesis, Czech Technical University, Prague, Czech Republic, 2000.
J.E. Hopcroft and J.D. Ullman. Introduction to automata, languages and computations. Addison-Wesley, Reading, MA, 1979.
D. C. Kozen. Automata and Computability. Springer-Verlag, Berlin, 1997.
G. Navarro and R. Baeza-Yates. Improving an algorithm for approximate pattern matching. Technical Report TR/DCC-98-5, Dept. of Computer Science, University of Chile, 1998.
R. K. Shyamasundar. A simple string matching algorithm. Technical report, Tata Institute of Fundamental Research, 1976.
S. Wu and U. Manber. Fast text searching allowing errors. Commun. ACM, 35(10):83–91, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Holub, J. (2002). Bit Parallelism - NFA Simulation. In: Watson, B.W., Wood, D. (eds) Implementation and Application of Automata. CIAA 2001. Lecture Notes in Computer Science, vol 2494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36390-4_13
Download citation
DOI: https://doi.org/10.1007/3-540-36390-4_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00400-4
Online ISBN: 978-3-540-36390-3
eBook Packages: Springer Book Archive