Regular expressions into finite automata
From MaRDI portal
Publication:1314367
DOI10.1016/0304-3975(93)90287-4zbMATH Open0811.68096DBLPjournals/tcs/Bruggemann-Klein93OpenAlexW2099540492WikidataQ61458432 ScholiaQ61458432MaRDI QIDQ1314367FDOQ1314367
Authors: Anne Brüggemann-Klein 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- THE ABSTRACT THEORY OF AUTOMATA
- Derivatives of Regular Expressions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- From regular expressions to deterministic automata
- Title not available (Why is that?)
- Deterministic regular languages
- Ambiguity in Graphs and Expressions
- Title not available (Why is that?)
Cited In (95)
- Compact and fast algorithms for safe regular expression search
- A Unified Construction of the Glushkov, Follow, and Antimirov Automata
- The complexity of regular(-like) expressions
- Inclusion Test Algorithms for One-Unambiguous Regular Expressions
- Path constraints in semistructured data
- Characterization of Glushkov automata
- Regular Expressions with Counting: Weak versus Strong Determinism
- Computing with relational machines
- An optimal parallel algorithm to convert a regular expression into its Glushkov automaton
- Partial derivatives of regular expressions and finite automaton constructions
- Deciding determinism of regular languages
- From regular expressions to DFA's using compressed NFA's
- Translating regular expressions into small \(\epsilon \)-free nondeterministic finite automata
- Efficient inclusion checking for deterministic tree automata and XML schemas
- One-unambiguous regular languages
- Schema-Guided Induction of Monadic Queries
- Deciding determinism of unary languages
- NORMALIZED EXPRESSIONS AND FINITE AUTOMATA
- Valuations, regular expressions, and fractal geometry
- How expressions can code for automata
- Streaming tree automata
- Succinctness of regular expressions with interleaving, intersection and counting
- Glushkov Construction For Series: The Non Commutative Case
- Title not available (Why is that?)
- SGML and XML document grammars and exceptions
- Obtaining shorter regular expressions from finite-state automata
- More Concise Representation of Regular Languages by Automata and Regular Expressions
- Motif statistics.
- Definability by weakly deterministic regular expressions with counters is decidable
- Sublinear DTD validity
- Two Algorithms For Languages Recognized By Graph Algebras
- Reducing NFAs by invariant equivalences.
- The inclusion problem for regular expressions
- The validation of SGML content models
- One-unambiguous regular languages
- More concise representation of regular languages by automata and regular expressions
- Series-Parallel Automata and Short Regular Expressions
- On the size of partial derivatives and the word membership problem
- Checking determinism of regular expressions with counting
- One-unambiguity of regular expressions with numeric occurrence indicators
- A mesh of automata
- Postfix automata
- From regular expressions to finite automata∗
- Position automaton construction for regular expressions with intersection
- An efficient null-free procedure for deciding regular language membership
- From regular expressions to smaller NFAs
- From finite automata to regular expressions and back -- a summary on descriptional complexity
- FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
- Title not available (Why is that?)
- Automata and rational expressions
- Descriptional complexity of regular languages
- Succinctness of pattern-based schema languages for XML
- Deterministic regular languages
- Fast equation automaton computation
- Multi-tilde Operators and Their Glushkov Automata
- Regular expression for a language without empty word
- Derivatives of regular expressions and an application
- Adding pebbles to weighted automata: easy specification \& efficient evaluation
- On the average size of Glushkov and partial derivative automata
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
- A faster algorithm for finding shortest substring matches of a regular expression
- Follow automata.
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- Generalizations of 1-deterministic regular languages
- On average behaviour of regular expressions in strong star normal form
- Title not available (Why is that?)
- Left is Better Than Right for Reducing Nondeterminism of NFAs
- Title not available (Why is that?)
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
- Efficient enumeration of regular expressions for faster regular expression synthesis
- Memoized regular expressions
- Efficient testing and matching of deterministic regular expressions
- The word problem for visibly pushdown languages described by grammars
- Algorithms and Computation
- Construction of Tree Automata from Regular Expressions
- Theoretical computer science: computational complexity
- Algorithms for checking intersection non-emptiness of regular expressions
- Efficient weighted expressions conversion
- Location automata for regular expressions with shuffle and intersection
- Derivatives and finite automata of expressions in star normal form
- An efficient algorithm for the construction of the equation tree automaton
- The complexity of SORE-definability problems
- Smaller representation of compiled regular expressions
- Manipulation of regular expressions using derivatives: an overview
- Location based automata for expressions with shuffle
- Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata
- From Regular Weighted Expressions to Finite Automata
- Title not available (Why is that?)
- Self-certifying railroad diagrams. Or: how to teach nondeterministic finite automata
- The net automaton of a rational expression
- EVALUATION OF THREE IMPLICIT STRUCTURES TO IMPLEMENT NONDETERMINISTIC AUTOMATA FROM REGULAR EXPRESSIONS
- Deterministic regular expressions with back-references
- Partial derivative automaton by compressing regular expressions
- Enumerated BSP Automata
Uses Software
This page was built for publication: Regular expressions into finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314367)
