Canonical derivatives, partial derivatives and finite automaton constructions.
From MaRDI portal
Publication:1853522
DOI10.1016/S0304-3975(01)00267-5zbMath1061.68109MaRDI QIDQ1853522
Jean-Marc Champarnaud, Djelloul Ziadi
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (39)
Derivatives of Regular Expressions and an Application ⋮ NORMALIZED EXPRESSIONS AND FINITE AUTOMATA ⋮ Derived-Term Automata for Extended Weighted Rational Expressions ⋮ ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH ⋮ Rational and Recognisable Power Series ⋮ Prefix and Right-Partial Derivative Automata ⋮ Manipulation of regular expressions using derivatives: an overview ⋮ Tree pattern matching from regular tree expressions ⋮ Location automata for regular expressions with shuffle and intersection ⋮ Location automata for synchronised shuffle expressions ⋮ Automata for regular expressions with shuffle ⋮ Construction of Tree Automata from Regular Expressions ⋮ Derivatives of rational expressions and related theorems. ⋮ Location based automata for expressions with shuffle ⋮ Extended to multi-tilde-bar regular expressions and efficient finite automata constructions ⋮ ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA ⋮ On finite-index extensions of subgroups of free groups ⋮ Unnamed Item ⋮ Description and analysis of a bottom-up DFA minimization algorithm ⋮ Functional dependencies on extended relations defined by regular languages ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ Derivatives and Finite Automata of Expressions in Star Normal Form ⋮ Introducing VAUCANSON ⋮ Derivatives of rational expressions with multiplicity ⋮ Language operations with regular expressions of polynomial size ⋮ A mesh of automata ⋮ Multi-tilde-bar expressions and their automata ⋮ How expressions can code for automata ⋮ From regular expressions to smaller NFAs ⋮ From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity ⋮ On Average Behaviour of Regular Expressions in Strong Star Normal Form ⋮ Partial derivatives of regular expressions over alphabet-invariant and user-defined labels ⋮ An Efficient Algorithm for the Construction of the Equation Tree Automaton ⋮ Position Automaton Construction for Regular Expressions with Intersection ⋮ Fast equation automaton computation ⋮ Construction of tree automata from regular expressions ⋮ Automata and rational expressions ⋮ Partial derivative automaton by compressing regular expressions ⋮ Computing with relational machines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From regular expressions to deterministic automata
- Partial derivatives of regular expressions and finite automaton constructions
- The passing of a rational expression to a nondeterministic finite automaton
- Automata Studies. (AM-34)
- THE ABSTRACT THEORY OF AUTOMATA
- Three Partition Refinement Algorithms
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- Derivatives of Regular Expressions
This page was built for publication: Canonical derivatives, partial derivatives and finite automaton constructions.
