Ville Laurikari  Home/Search
Context
Related
| iki.fi/vl/regexsubmatch.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iki.fi/vl/cv (more) Homepages: V.Laurikari |
Rate this article:      (best)Comment on this article |
Abstract: String pattern matching in its different forms is an important topic in theoretical computer science. This thesis concentrates on the problem of regular expression matching with submatch addressing, where the position and extent of the substrings matched by given subexpressions must be provided. The algorithms in widespread use at the time either take exponential worst-case time to find a match, can handle only a subset of all regular expressions, or use space proportional to the length of the... (Update)
Active bibliography (related documents): More All
1.7: NFAs with Tagged Transitions, their Conversion to Deterministic.. - Laurikari (2000) (Correct)
1.0: RegReg: a Lightweight Generator of Robust Parsers for Irregular .. - Latendresse (Correct)
0.6: Greedy Regular Expression Matching - Frisch, Cardell (2004) (Correct)
Similar documents based on text: More All
0.9: Using Hypermedia to Provide Application Support - Saarela (1995) (Correct)
0.7: Memory Reference Locality in Binary Search Trees - Oksanen (1995) (Correct)
0.5: A Replicated and Persistent Functional Programming Environment -.. - Oksanen (2001) (Correct)
BibTeX entry: (Update)
@mastersthesis{ laurikari-submatch,
author = "Ville Laurikari",
title = "Efficient submatch addressing for regular expressions",
school = "Helsinki University of Technology",
year = "2001",
url = "citeseer.ist.psu.edu/480392.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
866 Techniques and Tools (context) - Aho, Sethi et al. - 1986
476 Programming Language (context) - Kernighan, Ritchie - 1988
291 A logical calculus of the ideas immanent in nervous activity (context) - McCulloch, Pitts - 1943
259 Elements of the Theory of Computation (context) - Lewis, Papadimitrou - 1981
180 Binary codes capable of correcting deletions (context) - Levenshtein - 1966
148 Storing a sparse table with O (context) - Fredman, Komls et al. - 1984
142 Finding patterns common to a set of strings (context) - Angluin - 1979
106 Purely Functional Data Structures - Okasaki - 1998
102 Dynamic perfect hashing: Upper and lower bounds - Dietzfelbinger, Karlin et al.
97 The AWK Programming Language (context) - Aho, Kernighan et al. - 1988
80 Finite automata (context) - Perrin - 1990
67 O'Reilly and Associates (context) - Wall, Christiansen et al. - 2000
66 Derivatives of regular expressions (context) - Brzozowski - 1964
64 From regular expressions to deterministic automata (context) - Berry, Sethi - 1986
62 Regular expression types for XML - Hosoya, Vouillon - 2000
54 Regular expression pattern matching for XML - Hosoya, Pierce - 2001
45 Approximate matching of regular expressions (context) - Myers, Miller - 1989
43 Storing a sparse table (context) - Tarjan, Yao - 1979
33 Regular expressions and state graphs for automata (context) - McNaughton, Yamada - 1960
24 Economy of description by automata (context) - Meyer, Fischer
22 A four Russians algorithm for regular expression pattern mat.. (context) - Myers - 1992
15 Functional programming with graphs - Erwig - 1997
12 the use of regular expressions for searching text - Clarke, Cormack - 1997
8 Storing a dynamic sparse table (context) - Aho, Lee - 1986
5 Practice and Experience (context) - Kearns, Software - 1991
5 Approximate regular expression pattern matching with concave.. - Knight, Myers - 1995
5 Reporting exact and approximate regular expression matches - Myers, Oliva et al. - 1998
4 Real-time Garbage Collection of a Functional Persistent Heap (context) - Oksanen - 1999
4 a lexical analyzer generator (context) - Lesk - 1975
4 Extending regular expressions with context operators and par.. - Kearns - 1991
4 A procedure for checking equality of regular expressions (context) - Ginzburg - 1967
3 Representation of events in nerve nets and nite automata (context) - Kleene - 1956
3 A string manipulation language (context) - Farber, Griswold et al. - 1964
3 ciently building a parse tree from a regular expression (context) - Dub, Feeley - 2000
2 Regular expressions with semantic rules and their applicatio.. (context) - Nakata, Sassa - 1991
2 their conversion to deterministic automata and application t.. (context) - Laurikari, tagged - 2000
2 volume 1 of Parsing Theory (context) - Sippu, Soisalon-Soininen et al. - 1988
2 Generation of pattern-matching algorithms by extended regula.. - Nakata - 1993
2 nding patterns in strings (context) - Aho - 1990
2 nite-state transducers for semistructured data extraction fr.. (context) - Hsu, Dung - 1998
2 Programming techniques: Regular expression search algorithm (context) - Thompson - 1968
2 Fast Lexical Analyzer Generator (context) - Paxson - 1995
1 Partial derivatives of regular expressions and nite automat.. (context) - Antimirov - 1996
1 Approximate regular expression matching (context) - Mutko - 1996
1 Regular expressions with nested levels of back referencing f.. - Larsen - 1998
1 Portable Operating System Interface (context) - Electrical, Engineers et al. - 1992
1 erent representations of languages (context) - Hartmanis, succinctness - 1980
1 Design of sequential machines from their regular expressions (context) - Ott, Feinstein - 1961
1 Technical Report CUCS (context) - Kearns, user's
1 Deterministic part-of-speech tagging with nitestate transdu.. (context) - Roche, Schabes - 1995
1 Coded Character Set - 7Bit American Standard Code for Inform.. (context) - Standards, ANSI
1 nite state transducers (context) - Roche
1 XML: The Annotated Speci cation (context) - DuCharme - 1999
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