Programming Techniques: Regular expression search algorithm

Cited in

(only showing first 100 items - show all)

Adapting functional programs to higher order logic
The complexity of restricted regular expressions and the synthesis problem for finite automata
On two-dimensional pattern-matching languages and their decision problems
Succinct representation of regular sets using gotos and Boolean variables
Approximate matching of regular expressions
AUTOMATE, a computing package for automata and finite semigroups
String matching problems over free partially commutative monoids
An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
The validation of SGML content models
From regular expressions to DFA's using compressed NFA's
A characterization of Thompson digraphs.
Follow automata.
Reducing NFAs by invariant equivalences.
Fast pattern matching in indexed texts
An efficient null-free procedure for deciding regular language membership
Characterization of Glushkov automata
A faster algorithm for finding shortest substring matches of a regular expression
On series-parallel pomset languages: rationality, context-freeness and automata
Construction of fuzzy automata from fuzzy regular expressions
Exact matching of RNA secondary structure patterns
Visibly linear dynamic logic
Regular expression searching on compressed text
On the size of partial derivatives and the word membership problem
Automata and rational expressions
Descriptional complexity of regular languages
From regular expression matching to parsing
Memoized regular expressions
On the decidability of infix inclusion problem
Manipulation of regular expressions using derivatives: an overview
How to settle the ReDoS problem: back to the classical automata theory
Formalising and implementing Boost POSIX regular expression matching
A string diagrammatic axiomatisation of finite-state automata
A mesh of automata
Evaluating Datalog via tree automata and cycluits
On the semantics of regular expression parsing in the wild
On the hierarchy of generalizations of one-unambiguous regular languages
Comparing the size of NFAs with and without \(\epsilon\)-transitions
Fast and compact regular expression matching
Efficient testing and matching of deterministic regular expressions
Regular expressions for decoding of neural network outputs
A hitchhiker's guide to descriptional complexity through analytic combinatorics
Visibly rational expressions
Prefix-free regular languages and pattern matching
Re-examining regular expressions with backreferences
NR-grep: A fast and flexible pattern-matching tool
Trading plaintext-awareness for simulatability to achieve chosen ciphertext security
From finite automata to regular expressions and back -- a summary on descriptional complexity
Derived-term automata of multitape rational expressions
The complexity of regular(-like) expressions
Deciding synchronous Kleene algebra with derivatives
On the semantics of regular expression parsing in the wild
Edit-distance between visibly pushdown languages
EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS
Compressing regular expressions' DFA table by matrix decomposition
Regular expressions at their best: a case for rational design
Prefix and Right-Partial Derivative Automata
Static detection of DoS vulnerabilities in programs that use regular expressions
PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA
Regular-expression derivatives re-examined
On Parallel Implementations of Deterministic Finite Automata
Implementation of State Elimination Using Heuristics
Prolog infinite trees and automata
Regular languages with variables on graphs
A compact function for regular expression pattern matching
Translating regular expression matching into transducers
Probabilistic grammars and languages
String matching with variable length gaps
Tree pattern matching from regular tree expressions.
How expressions can code for automata
Postfix automata
Glushkov Construction For Series: The Non Commutative Case
Minimized Thompson NFA
From regular expressions to finite automata^∗
Tighter connections between Formula-SAT and shaving logs
scientific article; zbMATH DE number 7439745 (Why is no real title available?)
Proof-directed program transformation: a functional account of efficient regular expression matching
Not by equations alone. Reasoning with extensible effects
The prefix automaton
Fine-Grained Complexity Theory (Tutorial)
Brzozowski goes concurrent -- a Kleene theorem for pomset languages
scientific article; zbMATH DE number 7204945 (Why is no real title available?)
Equivalence checking for weak bi-Kleene algebra
Parametric linear dynamic logic
On average behaviour of regular expressions in strong star normal form
Computing with relational machines
A comment on ``Construction of fuzzy automata from fuzzy regular expressions
INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
Fast searching in packed strings
Space-efficient representations for Glushkov automata
An improved prefix-free regular-expression matching
The edit-distance between a regular language and a context-free language
scientific article; zbMATH DE number 3293675 (Why is no real title available?)
Linear parsing expression grammars
From regular expressions to deterministic automata
Regular expressions and transducers over alphabet-invariant and user-defined labels
scientific article; zbMATH DE number 7651219 (Why is no real title available?)
A Finite Axiomatisation of Finite-State Automata Using String Diagrams
Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
Fast matching of regular patterns with synchronizing counting
The net automaton of a rational expression

This page was built for publication: Programming Techniques: Regular expression search algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5549415)