Manipulation of regular expressions using derivatives: an overview
From MaRDI portal
Publication:2164731
DOI10.1007/978-3-031-07469-1_2OpenAlexW4285307402MaRDI QIDQ2164731
Publication date: 16 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07469-1_2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantitative Kleene coalgebras
- From regular expressions to deterministic automata
- On equations for regular languages, finite automata, and sequential networks
- Partial derivatives of regular expressions and finite automaton constructions
- Rewriting extended regular expressions
- Simplified parsing expression derivatives
- Fast equation automaton computation
- The complexity of restricted regular expressions and the synthesis problem for finite automata
- Minimisation of acyclic deterministic automata in linear time
- Regular expressions into finite automata
- From regular expressions to DFA's using compressed NFA's
- Automata for regular expressions with shuffle
- Derivatives of rational expressions with multiplicity
- Canonical derivatives, partial derivatives and finite automaton constructions.
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- On the size of partial derivatives and the word membership problem
- Automata and rational expressions
- Partial derivative automaton by compressing regular expressions
- Location based automata for expressions with shuffle
- A mesh of automata
- Deciding Kleene algebra terms equivalence in Coq
- Derivatives and partial derivatives for regular shuffle expressions
- Descriptional complexity of formal systems. 18th IFIP WG 1.2 international conference, DCFS 2016, Bucharest, Romania, July 5--8, 2016. Proceedings
- From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity
- Position Automaton Construction for Regular Expressions with Intersection
- Derived-Term Automata of Multitape Rational Expressions
- Unified Decision Procedures for Regular Expression Equivalence
- THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS
- ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH
- Checking NFA equivalence with bisimulations up to congruence
- Partial Derivatives for Context-Free Languages
- Linear Automaton Transformations
- THE ABSTRACT THEORY OF AUTOMATA
- ANTIMIROV AND MOSSES'S REWRITE SYSTEM REVISITED
- Simplifying Regular Expressions
- On the Average Size of Glushkov’s Automata
- Three Partition Refinement Algorithms
- DIFFERENTIATION OF K-RATIONAL EXPRESSIONS
- Tree Automata Constructions from Regular Expressions: a Comparative Study
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA
- From regular expressions to finite automata∗
- An Efficient Algorithm for the Construction of the Equation Tree Automaton
- An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression
- Two Complete Axiom Systems for the Algebra of Regular Events
- A Procedure for Checking Equality of Regular Expressions
- Programming Techniques: Regular expression search algorithm
- Derivatives of Regular Expressions
- Boolean Matrices and the Stability of Neural Nets
- A logical calculus of the ideas immanent in nervous activity
- Partial derivatives of regular expressions over alphabet-invariant and user-defined labels
This page was built for publication: Manipulation of regular expressions using derivatives: an overview
