From regular expressions to deterministic automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3967898 (Why is no real title available?)
- scientific article; zbMATH DE number 3251424 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- A complete inference system for a class of regular behaviours
- Derivatives of Regular Expressions
- Programming Techniques: Regular expression search algorithm
Cited in
(92)- The complexity of regular(-like) expressions
- Canonical derivatives, partial derivatives and finite automaton constructions.
- THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
- Characterization of Glushkov automata
- Computation of regular expression derivatives
- Algorithms for the compilation of regular expressions into PLAs
- scientific article; zbMATH DE number 2081047 (Why is no real title available?)
- PuRSUE -- from specification of robotic environments to synthesis of controllers
- Partial derivatives of regular expressions and finite automaton constructions
- Computing with relational machines
- Adapting functional programs to higher order logic
- From regular expressions to DFA's using compressed NFA's
- An optimal construction of finite automata from regular expressions
- scientific article; zbMATH DE number 5903158 (Why is no real title available?)
- scientific article; zbMATH DE number 7075888 (Why is no real title available?)
- scientific article; zbMATH DE number 798342 (Why is no real title available?)
- One-unambiguous regular languages
- scientific article; zbMATH DE number 1773077 (Why is no real title available?)
- A decision procedure for regular membership and length constraints over unbounded strings
- NR-grep: A fast and flexible pattern-matching tool
- Minimized Thompson NFA
- Construction of tree automata from regular expressions
- How expressions can code for automata
- The inclusion problem for regular expressions
- Proof-directed program transformation: a functional account of efficient regular expression matching
- Vacuity in practice: temporal antecedent failure
- Glushkov Construction For Series: The Non Commutative Case
- scientific article; zbMATH DE number 1472276 (Why is no real title available?)
- Construction of Tree Automata from Regular Expressions
- scientific article; zbMATH DE number 2102759 (Why is no real title available?)
- Implementation and Application of Automata
- Space-efficient representations for Glushkov automata
- Hedge Pattern Partial Derivative
- Equations and regular-like expressions for afa
- Theoretical computer science: computational complexity
- Algorithms for checking intersection non-emptiness of regular expressions
- Motif statistics.
- Functional dependencies on extended relations defined by regular languages
- Hardware Implementations of Finite Automata and Regular Expressions
- Compact representations of automata for regular expression matching
- Reducing NFAs by invariant equivalences.
- A deterministic parsing algorithm for ambiguous regular expressions
- Two Algorithms For Languages Recognized By Graph Algebras
- Regular-expression derivatives re-examined
- Nondeterministic biautomata and their descriptional complexity
- The validation of SGML content models
- Enumerating the strings of regular languages
- One-unambiguous regular languages
- Derivatives and finite automata of expressions in star normal form
- Passive testing with asynchronous communications and timestamps
- Series-Parallel Automata and Short Regular Expressions
- Better automata through process algebra
- A mesh of automata
- Prolog infinite trees and automata
- Manipulation of regular expressions using derivatives: an overview
- Clausal tableaux for hybrid PDL
- An efficient null-free procedure for deciding regular language membership
- Position automaton construction for regular expressions with intersection
- Boolean operations and inclusion test for attribute-element constraints
- From regular expressions to finite automata∗
- From regular expressions to smaller NFAs
- Clocks in dataflow languages
- From Regular Weighted Expressions to Finite Automata
- From finite automata to regular expressions and back -- a summary on descriptional complexity
- Self-certifying railroad diagrams. Or: how to teach nondeterministic finite automata
- scientific article; zbMATH DE number 1870546 (Why is no real title available?)
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
- Efficient expansion of factored expressions
- Monadic expressions and their derivatives
- Generating tokenizers with flat automata
- scientific article; zbMATH DE number 3870596 (Why is no real title available?)
- Local languages and the Berry-Sethi algorithm
- Language operations with regular expressions of polynomial size
- Regular expressions into finite automata
- Automata and rational expressions
- Descriptional complexity of regular languages
- Kleene theorems for product systems
- Embedding finite automata within regular expressions
- Regular expression searching on compressed text
- Automata for regular expressions with shuffle
- Deterministic regular languages
- Adding pebbles to weighted automata: easy specification \& efficient evaluation
- Implementation and Application of Automata
- Derivatives of regular expressions and an application
- From Mirkin's prebases to Antimirov's word partial derivatives
- On the average size of Glushkov and partial derivative automata
- Follow automata.
- scientific article; zbMATH DE number 4003556 (Why is no real title available?)
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- From ambiguous regular expressions to deterministic parsing automata
- Partial derivatives of an extended regular expression
- Compilation of the ELECTRE reactive language into finite transition systems
This page was built for publication: From regular expressions to deterministic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580983)
