FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
From MaRDI portal
Publication:4786303
DOI10.1142/S0218196701000772zbMath1024.68065OpenAlexW2103737357MaRDI QIDQ4786303
Djelloul Ziadi, Jean-Marc Champarnaud
Publication date: 15 December 2002
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196701000772
Related Items (18)
NORMALIZED EXPRESSIONS AND FINITE AUTOMATA ⋮ Manipulation of regular expressions using derivatives: an overview ⋮ Tree pattern matching from regular tree expressions ⋮ Acyclic automata and small expressions using multi-tilde-bar operators ⋮ Construction of Tree Automata from Regular Expressions ⋮ A New Family of Regular Operators Fitting with the Position Automaton Computation ⋮ From regular expressions to smaller NFAs ⋮ Multi-tilde Operators and Their Glushkov Automata ⋮ On the size of partial derivatives and the word membership problem ⋮ An Efficient Algorithm for the Construction of the Equation Tree Automaton ⋮ From Tree Automata to Rational Tree Expressions ⋮ FROM THE $\mathcal{ZPC}$ STRUCTURE OF A REGULAR EXPRESSION TO ITS FOLLOW AUTOMATON ⋮ Small Extended Expressions for Acyclic Automata ⋮ Construction of tree automata from regular expressions ⋮ Partial derivative automaton by compressing regular expressions ⋮ Canonical derivatives, partial derivatives and finite automaton constructions. ⋮ Computing with relational machines ⋮ Operads, quasiorders, and regular languages
Cites Work
This page was built for publication: FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
