An efficient algorithm for the construction of the equation tree automaton
From MaRDI portal
Publication:4963261
DOI10.1142/S0129054118500156zbMATH Open1402.68119OpenAlexW2894804149WikidataQ129162916 ScholiaQ129162916MaRDI QIDQ4963261FDOQ4963261
Authors: Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi 
Publication date: 1 November 2018
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054118500156
Recommendations
- An efficient algorithm for the equation tree automaton via the \(k\)-c-continuations
- Fast equation automaton computation
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- An Efficient Computation of the Equation K-automaton of a Regular K-expression
- \(K\)-position, follow, equation and \(K\)-C-continuation tree automata constructions
Cites Work
- THE ABSTRACT THEORY OF AUTOMATA
- FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
- Partial derivatives of regular expressions and finite automaton constructions
- Three Partition Refinement Algorithms
- Follow automata.
- Minimisation of acyclic deterministic automata in linear time
- Linear Automaton Transformations
- Regular expressions into finite automata
- Fast equation automaton computation
- The passing of a rational expression to a nondeterministic finite automaton
- Canonical derivatives, partial derivatives and finite automaton constructions.
- From regular tree expression to position tree automaton
- Implementation and Application of Automata
- Construction of tree automata from regular expressions
- An efficient algorithm for the equation tree automaton via the \(k\)-c-continuations
Cited In (7)
- Another variation on the common subexpression problem
- An Efficient Computation of the Equation K-automaton of a Regular K-expression
- An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression
- An efficient algorithm for the equation tree automaton via the \(k\)-c-continuations
- Manipulation of regular expressions using derivatives: an overview
- \(K\)-position, follow, equation and \(K\)-C-continuation tree automata constructions
- Fast equation automaton computation
This page was built for publication: An efficient algorithm for the construction of the equation tree automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963261)
