Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching-Reference-Cited by-同舟云学术

Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching

Published:1999 Issue: Volume: Page:92-99
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Holub Jan,Melichar Bořivoj

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48057-9_8

Reference11 articles.

1. R. A. Baeza-Yates and G. H. Gonnet. A new approach to text searching. Commun. ACM, 35(10):74–82, 1992.

2. Lect Notes Comput Sci;Z. Galil,1989

3. 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, Prague, Czech Republic, 1996. Collaborative Report DC-96-10.

4. Collaborative Report;J. Holub,1997

5. J. Holub. Simulation of nondeterministic finite automata in approximate string matching. In WORKSHOP’ 98, pages 211–212, Czech Technical University, Prague, Czech Republic, February 1998.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fuzzy RDF Queries;Modeling and Management of Fuzzy Semantic RDF Data;2022

2. Fuzzy Sets and Fuzzy Database Modeling;Modeling and Management of Fuzzy Semantic RDF Data;2022

3. On the Levenshtein Automaton and the Size of the Neighbourhood of a Word;Language and Automata Theory and Applications;2016

4. Simple tree pattern matching for trees in the prefix bar notation;Discrete Applied Mathematics;2014-01

5. On Comparing Deterministic Finite Automata and the Shuffle of Words;Implementation and Application of Automata;2014