An efficient algorithm for the construction of the equation tree automaton

DOI10.1142/S0129054118500156MaRDI QIDQ4963261zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

C-continuationsequation automatonpartial derivativesregular tree expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

• An efficient algorithm for the equation tree automaton via the \(k\)-c-continuations
• Canonical derivatives, partial derivatives and finite automaton constructions.
• Construction of tree automata from regular expressions
• Fast equation automaton computation
• Follow automata.
• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
• From regular tree expression to position tree automaton
• Implementation and Application of Automata
• Linear Automaton Transformations
• Minimisation of acyclic deterministic automata in linear time
• Partial derivatives of regular expressions and finite automaton constructions
• Regular expressions into finite automata
• THE ABSTRACT THEORY OF AUTOMATA
• The passing of a rational expression to a nondeterministic finite automaton
• Three Partition Refinement Algorithms

Cited in

(7)

• Fast equation automaton computation
• Manipulation of regular expressions using derivatives: an overview
• An Efficient Computation of the Equation K-automaton of a Regular K-expression
• \(K\)-position, follow, equation and \(K\)-C-continuation tree automata constructions
• An efficient algorithm for the equation tree automaton via the \(k\)-c-continuations
• An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression
• Another variation on the common subexpression problem

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)