{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:19:08Z","timestamp":1725484748815},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540004004"},{"type":"electronic","value":"9783540363903"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36390-4_13","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T19:45:05Z","timestamp":1180208705000},"page":"149-160","source":"Crossref","is-referenced-by-count":2,"title":["Bit Parallelism - NFA Simulation"],"prefix":"10.1007","author":[{"given":"Jan","family":"Holub","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"issue":"6","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"K. Abrahamson. Generalized string matching. SI AM J. Comput., 16(6):1039\u20131051, 1987.","journal-title":"SI AM J. Comput."},{"issue":"10","key":"13_CR2","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. A. Baeza-Yates","year":"1992","unstructured":"R. A. Baeza-Yates and G. H. Gonnet. A new approach to text searching. Commun. ACM, 35(10):74\u201382, 1992.","journal-title":"Commun. ACM"},{"key":"13_CR3","unstructured":"R. A. Baeza-Yates and G. Navarro. A fast heuristic for approximate string matching. In N. Ziviani, R. Baeza-Yates, and K. Guimar\u00e3es, editors, Proceedings of the 3rd South American Workshop on String Processing, pages 47\u201363, Recife, Brazil, 1996. Carleton University Press."},{"key":"13_CR4","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching","author":"R. A. Baeza-Yates","year":"1996","unstructured":"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\u201323, Laguna Beach, CA, 1996. Springer-Verlag, Berlin."},{"key":"13_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-63307-3_57","volume-title":"Proceedings of the 5th Workshop on Algorithms and Data Structures","author":"R. A. Baeza-Yates","year":"1997","unstructured":"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\u2013184, Halifax, Nova Scotia, Canada, 1997. Springer-Verlag, Berlin."},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/PL00009253","volume":"23","author":"R. A. Baeza-Yates","year":"1999","unstructured":"R. A. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127\u2013158, 1999.","journal-title":"Algorithmica"},{"key":"13_CR7","first-page":"29","volume":"3","author":"B. D\u00f6m\u00f6lki","year":"1964","unstructured":"B. D\u00f6m\u00f6lki. An algorithm for syntactical analysis. Computational Linguistics, (3):29\u201346, 1964.","journal-title":"Computational Linguistics"},{"key":"13_CR8","unstructured":"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\u2013128, Perth, WA, Australia, 1999."},{"key":"13_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/3-540-48057-9_8","volume-title":"Proceedings of the 3rd International Workshop on Implementing Automata\u201998","author":"J. Holub","year":"1999","unstructured":"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\u201998, number 1660 in Lecture Notes in Computer Science, pages 92\u201399, Rouen, France, 1999. Springer-Verlag, Berlin."},{"key":"13_CR10","series-title":"Collaborative Report DC-96-10","first-page":"19","volume-title":"Proceedings of the Prague Stringologic Club Workshop\u2019 96","author":"J. Holub","year":"1996","unstructured":"J. Holub. Reduced nondeterministic finite automata for approximate string matching. In J. Holub, editor, Proceedings of the Prague Stringologic Club Workshop\u2019 96, pages 19\u201327, Czech Technical University, Prague, Czech Republic, 1996. Collaborative Report DC-96-10."},{"key":"13_CR11","volume-title":"Master\u2019s thesis","author":"J. Holub","year":"1996","unstructured":"J. Holub. Approximate string matching in text. Master\u2019s thesis, Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic, February 1996."},{"key":"13_CR12","series-title":"Collaborative Report DC-97-03","first-page":"39","volume-title":"Proceedings of the Prague Stringology Club Workshop\u2019 97","author":"J. Holub","year":"1997","unstructured":"J. Holub. Simulation of NFA in approximate string and sequence matching. In J. Holub, editor, Proceedings of the Prague Stringology Club Workshop\u2019 97, pages 39\u201346, Czech Technical University, Prague, Czech Republic, 1997. Collaborative Report DC-97-03."},{"key":"13_CR13","series-title":"Ph. D. Thesis","volume-title":"Simulation of Nondeterministic Finite Automata in Pattern Matching","author":"J. Holub","year":"2000","unstructured":"J. Holub. Simulation of Nondeterministic Finite Automata in Pattern Matching. Ph. D. Thesis, Czech Technical University, Prague, Czech Republic, 2000."},{"key":"13_CR14","volume-title":"Introduction to automata, languages and computations","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to automata, languages and computations. Addison-Wesley, Reading, MA, 1979."},{"key":"13_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1844-9","volume-title":"Automata and Computability","author":"D. C. Kozen","year":"1997","unstructured":"D. C. Kozen. Automata and Computability. Springer-Verlag, Berlin, 1997."},{"key":"13_CR16","unstructured":"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."},{"key":"13_CR17","unstructured":"R. K. Shyamasundar. A simple string matching algorithm. Technical report, Tata Institute of Fundamental Research, 1976."},{"issue":"10","key":"13_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"S. Wu and U. Manber. Fast text searching allowing errors. Commun. ACM, 35(10):83\u201391, 1992.","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36390-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T18:31:12Z","timestamp":1550341872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36390-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540004004","9783540363903"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-36390-4_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}