scientific article; zbMATH DE number 1786456

MaRDI QIDQ4547747zbMATH OpenFDO

Authors Djelloul Ziadi, Jean-Marc Champarnaud

Publication date 21 August 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2089/20890157

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
• An Efficient Computation of the Equation $\mathbb{K}$ -Automaton of a Regular $\mathbb{K}$ -Expression
• scientific article; zbMATH DE number 1773077
• An Efficient Computation of the Equation K-automaton of a Regular K-expression
• Fast equation automaton computation

Cited in

(11)

• Fast equation automaton computation
• Follow automata.
• Reducing NFAs by invariant equivalences.
• Construction of fuzzy automata from fuzzy regular expressions
• Canonical derivatives, partial derivatives and finite automaton constructions.
• Efficient weighted expressions conversion
• scientific article; zbMATH DE number 1773077 (Why is no real title available?)
• Computingϵ-Free NFA from Regular Expressions inO(nlog²(n)) Time
• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
• Reduction of fuzzy automata by means of fuzzy quasi-orders
• Fuzzy relation equations and reduction of fuzzy automata

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547747)