B. Watson. A new regular grammar pattern matching algorithm. In Proc 4th Annual European Symposium, LNCS 1136, pages 364--377, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Regular Expression Searching on Compressed Text - Navarro (Correct)
....nal module is obtained, so the result is an NFA of DFAs. The ideas presented up to now aim at a good implementation of the automaton, but they must inspect all the text characters. Other proposals try to skip some text characters, as it is usual for simple pattern matching. For example, in [32] they present an algorithm that determines the minimum length of a string matching the regular expression and forms a trie with all the pre xes of that length of strings matching the regular expression. A multipattern search algorithm like Commentz Walter [7] is run over those pre xes as a lter ....
....recent development, also in this line, is [24] They invert the arrows of the DFA and make all states initial and the initial state nal. The result is an automaton that recognizes all the reverse pre xes of strings matching the regular expression. The idea is in this sense similar to that of [32], but takes less space. The search method is also di erent: instead of a Boyer Moore like algorithm, it is based on BNDM [26] 3.2 Compressed Pattern Matching The compressed matching problem was rst de ned in the work of Amir and Benson [2] as the task of performing string matching in a ....
[Article contains additional citation context not shown here]
B. Watson. A new regular grammar pattern matching algorithm. In Proc. 4th Annual European Symposium on Algorithms (ESA'96), pages 364-377, 1996.
NFAs with Tagged Transitions, their Conversion to Deterministic.. - Laurikari (2000) (Correct)
....it is possible to achieve sublinear expected time for any regular expression, even logarithmic expected time, if preprocessing of the text to be searched is allowed using the algorithms developed for regular expressions by R. Baeza Yates [4, 3] or in the case of regular grammars by B. W. Watson [13, 14]. 6. Conclusions I have described an efficient way to match regular languages and extract last points of use for selected transitions in a single pass. The algorithms are used in a regular expression matching and search library, and a lexical analyzer library, for a high level, functional ....
B. Watson. A new regular grammar pattern matching algorithm. In J. Diaz and M. Serna, editors, Proceedings of the European Symposium on Algorithms, volume 1136 of Lecture Notes in Computer Science, pages 364--377, Berlin, Sept. 1996. Springer.
Pattern Matching - Navarro (Correct)
No context found.
B. Watson. A new regular grammar pattern matching algorithm. In Proc 4th Annual European Symposium, LNCS 1136, pages 364--377, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC