Regular expressions into finite automata
From MaRDI portal
Publication:1314367
DOI10.1016/0304-3975(93)90287-4zbMath0811.68096OpenAlexW2099540492WikidataQ61458432 ScholiaQ61458432MaRDI QIDQ1314367
Publication date: 22 February 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90287-4
Related Items (81)
FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS ⋮ Derivatives of Regular Expressions and an Application ⋮ Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata ⋮ Two Algorithms For Languages Recognized By Graph Algebras ⋮ Translating regular expressions into small ε-free nondeterministic finite automata ⋮ NORMALIZED EXPRESSIONS AND FINITE AUTOMATA ⋮ One-unambiguity of regular expressions with numeric occurrence indicators ⋮ Glushkov Construction For Series: The Non Commutative Case ⋮ THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS ⋮ Regular expression for a language without empty word ⋮ Valuations, regular expressions, and fractal geometry ⋮ Manipulation of regular expressions using derivatives: an overview ⋮ The validation of SGML content models ⋮ Compact and fast algorithms for safe regular expression search ⋮ Efficient testing and matching of deterministic regular expressions ⋮ Definability by Weakly Deterministic Regular Expressions with Counters is Decidable ⋮ Deterministic regular languages ⋮ From regular expressions to DFA's using compressed NFA's ⋮ The net automaton of a rational expression ⋮ Left is Better Than Right for Reducing Nondeterminism of NFAs ⋮ Deciding determinism of unary languages ⋮ Location automata for regular expressions with shuffle and intersection ⋮ Smaller representation of compiled regular expressions ⋮ Efficient weighted expressions conversion ⋮ A faster algorithm for finding shortest substring matches of a regular expression ⋮ Schema-Guided Induction of Monadic Queries ⋮ More Concise Representation of Regular Languages by Automata and Regular Expressions ⋮ Follow automata. ⋮ Reducing NFAs by invariant equivalences. ⋮ Adding pebbles to weighted automata: easy specification \& efficient evaluation ⋮ Postfix automata ⋮ Path constraints in semistructured data ⋮ Location based automata for expressions with shuffle ⋮ Extended to multi-tilde-bar regular expressions and efficient finite automata constructions ⋮ The word problem for visibly pushdown languages described by grammars ⋮ Deciding determinism of regular languages ⋮ Partial derivatives of regular expressions and finite automaton constructions ⋮ ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA ⋮ Generalizations of 1-deterministic regular languages ⋮ EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS ⋮ The inclusion problem for regular expressions ⋮ More concise representation of regular languages by automata and regular expressions ⋮ Succinctness of pattern-based schema languages for XML ⋮ Derivatives and Finite Automata of Expressions in Star Normal Form ⋮ One-unambiguous regular languages ⋮ One-unambiguous regular languages ⋮ Streaming tree automata ⋮ Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata ⋮ Succinctness of regular expressions with interleaving, intersection and counting ⋮ A mesh of automata ⋮ How expressions can code for automata ⋮ From regular expressions to smaller NFAs ⋮ From regular expressions to finite automata∗ ⋮ Enumerated BSP Automata ⋮ Sublinear DTD Validity ⋮ From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity ⋮ On Average Behaviour of Regular Expressions in Strong Star Normal Form ⋮ Multi-tilde Operators and Their Glushkov Automata ⋮ On the size of partial derivatives and the word membership problem ⋮ Regular Expressions with Counting: Weak versus Strong Determinism ⋮ Unnamed Item ⋮ An Efficient Algorithm for the Construction of the Equation Tree Automaton ⋮ FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON ⋮ Position Automaton Construction for Regular Expressions with Intersection ⋮ Fast equation automaton computation ⋮ Deterministic regular expressions with back-references ⋮ Automata and rational expressions ⋮ Descriptional complexity of regular languages ⋮ An optimal parallel algorithm to convert a regular expression into its Glushkov automaton ⋮ An efficient null-free procedure for deciding regular language membership ⋮ Characterization of Glushkov automata ⋮ Efficient inclusion checking for deterministic tree automata and XML schemas ⋮ Inclusion Test Algorithms for One-Unambiguous Regular Expressions ⋮ Partial derivative automaton by compressing regular expressions ⋮ Motif statistics. ⋮ SGML and XML document grammars and exceptions ⋮ Checking determinism of regular expressions with counting ⋮ Computing with relational machines ⋮ Analysis of an efficient reduction algorithm for random regular expressions based on universality detection ⋮ Memoized regular expressions ⋮ Efficient enumeration of regular expressions for faster regular expression synthesis
Uses Software
Cites Work
This page was built for publication: Regular expressions into finite automata
