Derivatives of Regular Expressions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A Four Russians algorithm for regular expression pattern matching
Journal of the ACM (JACM)
A textual object management system
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
Optimizing ML with run-time code generation
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Fast text searching for regular expressions or automaton searching on tries
Journal of the ACM (JACM)
On the use of regular expressions for searching text
ACM Transactions on Programming Languages and Systems (TOPLAS)
tcc: a system for fast, flexible, and high-level dynamic code generation
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS)
Efficient string matching: an aid to bibliographic search
Communications of the ACM
A theory of discrete patterns and their implementation in SNOBOL4
Communications of the ACM
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Approximate matching of secondary structures
Proceedings of the sixth annual international conference on Computational biology
Algorithms for Computing Small NFAs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Fast Algorithms for Extended Regular Expression Matching and Searching
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Fast Regular Expression Search
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Compact DFA Representation for Fast Regular Expression Search
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Thompson Digraphs: A Characterization
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Implicit Structures to Implement NFA's from Regular Expressions
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Glushkov Construction for Multiplicities
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
New Finite Automaton Constructions Based on Canonical Derivatives
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Generic epsilon -Removal Algorithm for Weighted Automata
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Constructing NFA s by Optimal Use of Positions in Regular Expressions
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Regular Expression Searching over Ziv-Lempel Compressed Text
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Hardware algorithms for nonnumeric computation
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
A regular expression pattern matching processor for APL
APL '81 Proceedings of the international conference on APL
A brief history of just-in-time
ACM Computing Surveys (CSUR)
Reducing NFAs by invariant equivalences
Theoretical Computer Science
Information and Computation
A characterization of Thompson digraphs
Discrete Applied Mathematics
Regular expression searching on compressed text
Journal of Discrete Algorithms
Computational Linguistics
Extended finite state models of language
Natural Language Engineering
Exact pattern matching for RNA secondary structures
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
A simple way to construct NFA with fewer states and transitions
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Optimizing ML with run-time code generation
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Constructing a finite automaton for a given regular expression
ACM SIGACT News
Enumerating the strings of regular languages
Journal of Functional Programming
Processing XML streams with deterministic automata and stream indexes
ACM Transactions on Database Systems (TODS)
Approximate regular expression searching with arbitrary integer weights
Nordic Journal of Computing
Exact matching of RNA secondary structure patterns
Theoretical Computer Science - Pattern discovery in the post genome
Enabling massive scale document transformation for the semantic web: the universal parsing agent™
Proceedings of the 2005 ACM symposium on Document engineering
Performance of hardcoded finite automata
Software—Practice & Experience - Research Articles
A taxonomy of DFA-based string processors
SAICSIT '06 Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
An efficient index structure for XML based on generalized suffix tree
Information Systems
Obtaining shorter regular expressions from finite-state automata
Theoretical Computer Science
Fundamenta Informaticae
Comparing the size of NFAs with and without ε-transitions
Theoretical Computer Science
Stack virtualization for source level debugging
Software—Practice & Experience
Prefix-free regular languages and pattern matching
Theoretical Computer Science
Regular Expression Matching in Reconfigurable Hardware
Journal of Signal Processing Systems
EventScript: an event-processing language based on regular expressions with actions
Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems
Fundamenta Informaticae
Transforming Process Algebra Models into UML State Machines: Bridging a Semantic Gap?
ICMT '08 Proceedings of the 1st international conference on Theory and Practice of Model Transformations
Simple-regular expressions and languages
Journal of Automata, Languages and Combinatorics
Fast and compact regular expression matching
Theoretical Computer Science
Adapting functional programs to higher order logic
Higher-Order and Symbolic Computation
Efficient regular expression evaluation: theory to practice
Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Microtext: the design of a microprogrammed finite state search machine for full-text retrieval
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Insecure context switching: inoculating regular expressions for survivability
WOOT'08 Proceedings of the 2nd conference on USENIX Workshop on offensive technologies
A text pattern-matching tool based on Parsing Expression Grammars
Software—Practice & Experience
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Fundamenta Informaticae
Regular-expression derivatives re-examined
Journal of Functional Programming
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
Faster Regular Expression Matching
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On Parallel Implementations of Deterministic Finite Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Implementation of State Elimination Using Heuristics
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Proceedings of the 2nd international conference on Security of information and networks
Memory-efficient distribution of regular expressions for fast deep packet inspection
CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
ACM Transactions on Algorithms (TALG)
Identification of design motifs with pattern matching algorithms
Information and Software Technology
Regular Expression Matching on Graphics Hardware for Intrusion Detection
RAID '09 Proceedings of the 12th International Symposium on Recent Advances in Intrusion Detection
Structural and semantic aspects of similarity of Document Type Definitions and XML schemas
Information Sciences: an International Journal
Managing intrusion detection rule sets
Proceedings of the Third European Workshop on System Security
An effective algorithm for the membership problem for extended regular expressions
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
The effect of rewriting regular expressions on their accepting automata
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
An efficient computation of the equation K-automaton of a regular K-expression
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Clustering XML documents based on structural similarity
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Instrumentation of open-source software for intrusion detection
RV'07 Proceedings of the 7th international conference on Runtime verification
Robust and fast pattern matching for intrusion detection
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient Earley Parsing with Regular Right-hand Sides
Electronic Notes in Theoretical Computer Science (ENTCS)
A play on regular expressions: functional pearl
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Regular expression matching with multi-strings and intervals
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Improving NFA-based signature matching using ordered binary decision diagrams
RAID'10 Proceedings of the 13th international conference on Recent advances in intrusion detection
A framework for benchmarking FA-based string recognizers
SAICSIT '10 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
Complex event detection at wire speed with FPGAs
Proceedings of the VLDB Endowment
Fast bit-parallel matching for network and regular expressions
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
String matching with variable length gaps
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Fast searching in packed strings
Journal of Discrete Algorithms
PEG-based transformer provides front-, middle-and back-end stages in a simple compiler
Workshop on Self-Sustaining Systems
A clustering study of a 7000 EU document inventory using MDS and SOM
Expert Systems with Applications: An International Journal
Compressing regular expressions' DFA table by matrix decomposition
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Regular expressions at their best: a case for rational design
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Reverse engineering using graph queries
Graph transformations and model-driven engineering
Fast, memory-efficient regular expression matching with NFA-OBDDs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Note: From regular expressions to smaller NFAs
Theoretical Computer Science
A functional program for regular expressions matching
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Chop operations and expressions: descriptional complexity considerations
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Probabilistic Grammars and Languages
Journal of Logic, Language and Information
Approximate regular expression matching with multi-strings
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
How Well Do Search Engines Support Code Retrieval on the Web?
ACM Transactions on Software Engineering and Methodology (TOSEM)
Regular expressions and NFAs without Ε-transitions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
NFAs with and without ε-transitions
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Path-equivalent removals of ε-transitions in a genomic weighted finite automaton
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Overlap-Free regular languages
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Prefix-Free regular-expression matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
New algorithms for regular expression matching
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A unified construction of the glushkov, follow, and antimirov automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Intrusion detection: introduction to intrusion detection and security information management
Foundations of Security Analysis and Design III
A new linearizing restriction in the pattern matching problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Simplifying regular expressions: a quantitative perspective
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
An efficient coq tactic for deciding kleene algebras
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Shorter regular expressions from finite-state automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
Proton: multitouch gestures as regular expressions
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
String matching with variable length gaps
Theoretical Computer Science
Recent developments in the theory of data structures
Computer Languages
The validation of SGML content models
Mathematical and Computer Modelling: An International Journal
A user-to-user relationship-based access control model for online social networks
DBSec'12 Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy
An Efficient Computation of the Equation K-automaton of a Regular K-expression
Fundamenta Informaticae
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
Inside the class of REGEX languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Computing the edit-distance between a regular language and a context-free language
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Fundamenta Informaticae
Fundamenta Informaticae
FEMTO: fast search of large sequence collections
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Regular expression sub-matching using partial derivatives
Proceedings of the 14th symposium on Principles and practice of declarative programming
Kargus: a highly-scalable software-based intrusion detection system
Proceedings of the 2012 ACM conference on Computer and communications security
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
A staged static program analysis to improve the performance of runtime monitoring
ECOOP'07 Proceedings of the 21st European conference on Object-Oriented Programming
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
Fast submatch extraction using OBDDs
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
GPP-Grep: high-speed regular expression processing engine on general purpose processors
RAID'12 Proceedings of the 15th international conference on Research in Attacks, Intrusions, and Defenses
Space-Time tradeoffs for the regular constraint
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Multi-gigabit traffic identification on GPU
Proceedings of the first edition workshop on High performance and programmable networking
SideAuto: quantitative information flow for side-channel leakage in web applications
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Kleene algebra with tests and coq tools for while programs
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Picking pesky parameters: optimizing regular expression matching in practice
ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems
Extending the PCRE Library with Static Backtracking Based Just-in-Time Compilation Support
Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization
Exploring the design space of programmable regular expression matching accelerators
Journal of Systems Architecture: the EUROMICRO Journal
A regular expression matching engine with hybrid memories
Computer Standards & Interfaces
State Elimination Heuristics for Short Regular Expressions
Fundamenta Informaticae
| Hi-index | 48.26 |
A method for locating specific character strings embedded in character text is described and an implementation of this method in the form of a compiler is discussed. The compiler accepts a regular expression as source language and produces an IBM 7094 program as object language. The object program then accepts the text to be searched as input and produces a signal every time an embedded string in the text matches the given regular expression. Examples, problems, and solutions are also presented.