Partial derivatives of regular expressions and finite automata constructions
From MaRDI portal
(Redirected from Publication:4596644)
Recommendations
- Partial derivatives of regular expressions and finite automaton constructions
- Derivatives of regular expressions and an application
- Partial derivatives of an extended regular expression
- Canonical derivatives, partial derivatives and finite automaton constructions.
- scientific article; zbMATH DE number 1773077
Cited in
(34)- On the size of partial derivatives and the word membership problem
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
- Computation of regular expression derivatives
- A synchronous effects logic for temporal verification of pure Esterel
- Derivatives and partial derivatives for regular shuffle expressions
- From Mirkin's prebases to Antimirov's word partial derivatives
- From \(\omega\)-regular expressions to Büchi automata via partial derivatives
- A general framework for the derivation of regular expressions
- Approximate regular expressions and their derivatives
- Derivatives of regular expressions and an application
- Construction of state diagram of regular expressions using derivatives
- Partial derivatives for context-free languages. From -regular expressions to pushdown automata
- Partial derivatives of an extended regular expression
- Partial derivative automata formalized in Coq
- Construction of tree automata from regular expressions
- Partial derivative and position bisimilarity automata
- Prefix and Right-Partial Derivative Automata
- scientific article; zbMATH DE number 3870596 (Why is no real title available?)
- From Regular Weighted Expressions to Finite Automata
- Regular-expression derivatives re-examined
- Hedge Pattern Partial Derivative
- Construction of a Deterministicω-Automaton Using Derivatives
- Rewriting regular inequalities
- Derivatives of quantitative regular expressions
- Implementation and Application of Automata
- Partial Derivative Automaton for Regular Expressions with Shuffle
- From regular expressions to deterministic automata
- Reordering Derivatives of Trace Closures of Regular Languages.
- Partial derivatives of regular expressions over alphabet-invariant and user-defined labels
- Partial derivatives of regular expressions over alphabet-invariant and user-defined labels
- Automated temporal verification for algebraic effects
- Automated verification for real-time systems. Via implicit clocks and an extended Antimirov algorithm
- Partial derivatives of regular expressions and finite automaton constructions
- A general completeness theorem for skip-free star algebras
This page was built for publication: Partial derivatives of regular expressions and finite automata constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596644)
