Programming Techniques: Regular expression search algorithm
From MaRDI portal
Publication:5549415
DOI10.1145/363347.363387zbMath0164.46205OpenAlexW2072607050WikidataQ55878125 ScholiaQ55878125MaRDI QIDQ5549415
Publication date: 1968
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/363347.363387
Related Items
A Finite Axiomatisation of Finite-State Automata Using String Diagrams, Fast matching of regular patterns with synchronizing counting, The net automaton of a rational expression, Left is Better Than Right for Reducing Nondeterminism of NFAs, Better automata through process algebra, Unnamed Item, Completeness and the finite model property for Kleene algebra, reconsidered, Smaller representation of compiled regular expressions, Words-to-Letters Valuations for Language Kleene Algebras with Variable Complements, Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata, Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels, Matching regular expressions on uncertain data, INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES, Comparing the size of NFAs with and without \(\epsilon\)-transitions, On two-dimensional pattern-matching languages and their decision problems, Fast and compact regular expression matching, Glushkov Construction For Series: The Non Commutative Case, THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS, Succinct representation of regular sets using gotos and Boolean variables, Prolog infinite trees and automata, Minimized Thompson NFA, Prefix and Right-Partial Derivative Automata, 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, The validation of SGML content models, Obtaining shorter regular expressions from finite-state automata, Tree pattern matching from regular tree expressions, Approximate matching of regular expressions, Efficient testing and matching of deterministic regular expressions, Deciding Synchronous Kleene Algebra with Derivatives, On the Semantics of Regular Expression Parsing in the Wild, From regular expressions to DFA's using compressed NFA's, Regular expressions for decoding of neural network outputs, PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA, Regular languages with variables on graphs, Translating regular expression matching into transducers, Unnamed Item, Edit-Distance Between Visibly Pushdown Languages, Probabilistic grammars and languages, String matching with variable length gaps, A hitchhiker's guide to descriptional complexity through analytic combinatorics, Re-examining regular expressions with backreferences, Unnamed Item, A faster algorithm for finding shortest substring matches of a regular expression, A characterization of Thompson digraphs., Follow automata., Reducing NFAs by invariant equivalences., Formalising and implementing Boost POSIX regular expression matching, Space-Efficient Representations for Glushkov Automata, Postfix automata, Visibly rational expressions, Unnamed Item, On series-parallel pomset languages: rationality, context-freeness and automata, A string diagrammatic axiomatisation of finite-state automata, Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions, AUTOMATE, a computing package for automata and finite semigroups, Partial derivatives of regular expressions and finite automaton constructions, Prefix-free regular languages and pattern matching, AN IMPROVED PREFIX-FREE REGULAR-EXPRESSION MATCHING, Parametric linear dynamic logic, EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS, Unnamed Item, A comment on ``Construction of fuzzy automata from fuzzy regular expressions, Fast searching in packed strings, Construction of fuzzy automata from fuzzy regular expressions, String matching problems over free partially commutative monoids, Linear Parsing Expression Grammars, A mesh of automata, NR‐grep: a fast and flexible pattern‐matching tool, How expressions can code for automata, Exact matching of RNA secondary structure patterns, From regular expressions to smaller NFAs, From regular expressions to deterministic automata, From regular expressions to finite automata∗, Visibly linear dynamic logic, Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security, From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity, On Average Behaviour of Regular Expressions in Strong Star Normal Form, Regular-expression derivatives re-examined, On the size of partial derivatives and the word membership problem, Compressing Regular Expressions’ DFA Table by Matrix Decomposition, Regular Expressions at Their Best: A Case for Rational Design, Compact representations of automata for regular expression matching, Unnamed Item, Unnamed Item, Regular expression order-sorted unification and matching, A compact function for regular expression pattern matching, On Parallel Implementations of Deterministic Finite Automata, Implementation of State Elimination Using Heuristics, Fine-Grained Complexity Theory (Tutorial), Derived-Term Automata of Multitape Rational Expressions, Adapting functional programs to higher order logic, Fast pattern matching in indexed texts, Regular expression searching on compressed text, Automata and rational expressions, Descriptional complexity of regular languages, An optimal parallel algorithm to convert a regular expression into its Glushkov automaton, Evaluating Datalog via tree automata and cycluits, THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE, An efficient null-free procedure for deciding regular language membership, Characterization of Glushkov automata, From regular expression matching to parsing, Unnamed Item, The complexity of restricted regular expressions and the synthesis problem for finite automata, Proof-directed program transformation: A functional account of efficient regular expression matching, Not by equations alone: Reasoning with extensible effects, Computing with relational machines, Memoized regular expressions, On the semantics of regular expression parsing in the wild, On the hierarchy of generalizations of one-unambiguous regular languages
