Partial derivatives of regular expressions and finite automaton constructions
From MaRDI portal
(Redirected from Publication:672142)
Recommendations
- Partial derivatives of regular expressions and finite automata constructions
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Partial derivatives of an extended regular expression
- From regular expressions to deterministic automata
- scientific article; zbMATH DE number 1773077
Cites work
- scientific article; zbMATH DE number 4045163 (Why is no real title available?)
- scientific article; zbMATH DE number 193480 (Why is no real title available?)
- scientific article; zbMATH DE number 3526592 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (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?)
- scientific article; zbMATH DE number 3307592 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3316966 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- A Procedure for Checking Equality of Regular Expressions
- A taxonomy of sublinear multiple keyword pattern matching algorithms
- Complexity of matching problems
- DIFFERENTIATION OF K-RATIONAL EXPRESSIONS
- Derivatives of Regular Expressions
- From regular expressions to DFA's using compressed NFA's
- From regular expressions to deterministic automata
- Linear Automaton Transformations
- On equations for regular languages, finite automata, and sequential networks
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Partial derivatives of regular expressions and finite automata constructions
- Programming Techniques: Regular expression search algorithm
- Regular expressions into finite automata
- Rewriting extended regular expressions
- THE ABSTRACT THEORY OF AUTOMATA
- The Invalidity of Markoff's Schema
- Undecidability of ground reducibility for word rewriting systems with variables
Cited in
(only showing first 100 items - show all)- Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids
- Verified decision procedures for MSO on words based on derivatives of regular expressions
- Partial derivative automaton by compressing regular expressions
- Partial derivative automata formalized in Coq
- Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
- Operational semantics with semicommutations
- Derivatives of rational expressions with multiplicity
- On the size of partial derivatives and the word membership problem
- A mesh of automata
- Bottom-Up derivatives of tree expressions
- On the average state complexity of partial derivative transducers
- CLP(\(\mathsf{H}\)): constraint logic programming for hedges
- Computation of regular expression derivatives
- Derivatives and partial derivatives for regular shuffle expressions
- Simplifying regular expressions further
- On the positive calculus of relations with transitive closure
- Regular-expression derivatives re-examined
- Compact representations of automata for regular expression matching
- Regular expression order-sorted unification and matching
- On the computation of quotients and factors of regular languages
- Derivatives of rational expressions and related theorems.
- From \(\omega\)-regular expressions to Büchi automata via partial derivatives
- A formalisation of the Myhill-Nerode theorem based on regular expressions
- From regular expressions to finite automata∗
- Position automaton construction for regular expressions with intersection
- A decision procedure for regular membership and length constraints over unbounded strings
- Partial derivatives of regular expressions and finite automata constructions
- Location based automata for expressions with shuffle
- Operads, quasiorders, and regular languages
- Implementation and Application of Automata
- Derivatives of regular expressions and an application
- Fast equation automaton computation
- The complexity of regular(-like) expressions
- From regular expressions to smaller NFAs
- On average behaviour of regular expressions in strong star normal form
- From Mirkin's prebases to Antimirov's word partial derivatives
- A formally verified, optimized monitor for metric first-order dynamic logic
- Automata and rational expressions
- Descriptional complexity of regular languages
- From regular expressions to deterministic automata
- Follow automata.
- Rational and Recognisable Power Series
- Deciding Kleene algebra terms equivalence in Coq
- Derivatives for Enhanced Regular Expressions
- On the average size of Glushkov and partial derivative automata
- Partial derivatives of an extended regular expression
- An efficient null-free procedure for deciding regular language membership
- A goal-directed decision procedure for hybrid PDL
- Almost event-rate independent monitoring
- Completeness and the finite model property for Kleene algebra, reconsidered
- Computing with relational machines
- scientific article; zbMATH DE number 1773077 (Why is no real title available?)
- Multi-tilde-bar expressions and their automata
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- From finite automata to regular expressions and back -- a summary on descriptional complexity
- Inclusion Test Algorithms for One-Unambiguous Regular Expressions
- Algorithms for Kleene algebra with converse
- Deciding synchronous Kleene algebra with derivatives
- FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON
- Automata for regular expressions with shuffle
- Postfix automata
- Manipulation of regular expressions using derivatives: an overview
- Construction of fuzzy automata from fuzzy regular expressions
- On the average state complexity of partial derivative automata: an analytic combinatorics approach
- How expressions can code for automata
- FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA
- Reducing NFAs by invariant equivalences.
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Subset construction complexity for homogeneous automata, position automata and ZPC-structures
- A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
- On the state complexity of partial derivative automata for regular expressions with intersection
- Derivatives and finite automata of expressions in star normal form
- Derivatives of approximate regular expressions
- From tree automata to rational tree expressions
- Location automata for regular expressions with shuffle and intersection
- scientific article; zbMATH DE number 7649949 (Why is no real title available?)
- Partial derivative and position bisimilarity automata
- Monadic expressions and their derivatives
- The prefix automaton
- Fast matching of regular patterns with synchronizing counting
- Reordering Derivatives of Trace Closures of Regular Languages.
- Construction of state diagram of regular expressions using derivatives
- Self-certifying railroad diagrams. Or: how to teach nondeterministic finite automata
- Algorithms for checking intersection non-emptiness of regular expressions
- Kleene Theorems for Synchronous Products with Matching
- Partial derivatives of regular expressions over alphabet-invariant and user-defined labels
- scientific article; zbMATH DE number 3870596 (Why is no real title available?)
- Verification and enforcement of access control policies
- Antimirov and Mosses’s Rewrite System Revisited
- Hedge Pattern Partial Derivative
- A general framework for the derivation of regular expressions
- Partial Derivative Automaton for Regular Expressions with Shuffle
- Prefix and Right-Partial Derivative Automata
- Partial derivatives of regular expressions over alphabet-invariant and user-defined labels
- Left is Better Than Right for Reducing Nondeterminism of NFAs
- Derived-term automata of multitape rational expressions
- Corrigendum to our paper: How Expressions Can Code for Automata
- Incremental dead state detection in logarithmic time
- Equational theories of abnormal termination based on Kleene algebra
- Tree pattern matching from regular tree expressions.
This page was built for publication: Partial derivatives of regular expressions and finite automaton constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672142)
