scientific article; zbMATH DE number 2040906
From MaRDI portal
Publication:4452062
zbMATH Open1037.68078MaRDI QIDQ4452062FDOQ4452062
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
Title of this publication is not available (Why is that?)
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
- Title not available (Why is that?)
- Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
- On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations
- NFA reduction algorithms by means of regular inequalities
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Theory Is Forever
- Fuzzy relation equations and reduction of fuzzy automata
- Construction of fuzzy automata from fuzzy regular expressions
- Left is better than right for reducing nondeterminism of NFAs
- A non-deterministic finite automata minimization method based on the preorder relation
- Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences
- Combinatorial Pattern Matching
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)
