scientific article; zbMATH DE number 2040906

MaRDI QIDQ4452062zbMATH OpenFDO

Authors Jean-Marc Champarnaud, Fabien Coulon

Publication date 11 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2710/27100194.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Approximation algorithms (68W25)

Recommendations

• NFA reduction algorithms by means of regular inequalities
• Reducing NFAs by invariant equivalences.
• Combinatorial Pattern Matching
• Reduction of nondeterministic tree automata
• The Tractability Frontier for NFA Minimization
• The tractability frontier for NFA minimization
• scientific article; zbMATH DE number 3907802
• scientific article; zbMATH DE number 1929949
• Efficient reduction of nondeterministic automata with application to language inclusion testing

Cited in

(13)

• Left is better than right for reducing nondeterminism of NFAs
• NFA reduction algorithms by means of regular inequalities
• A non-deterministic finite automata minimization method based on the preorder relation
• Fuzzy relation equations and reduction of fuzzy automata
• Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
• Reduction of fuzzy automata by means of fuzzy quasi-orders
• Left is Better Than Right for Reducing Nondeterminism of NFAs
• Theory Is Forever
• scientific article; zbMATH DE number 1929949 (Why is no real title available?)
• Combinatorial Pattern Matching
• On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
• Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
• Construction of fuzzy automata from fuzzy regular expressions

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 Q4452062)