List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Fast algorithms for identifying maximal common connected sets of interval graphs Discrete Applied Mathematics | 2006-08-14 | Paper |
| ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON International Journal of Foundations of Computer Science | 2005-12-15 | Paper |
| Implementation and Application of Automata Lecture Notes in Computer Science | 2005-08-17 | Paper |
| BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS International Journal of Foundations of Computer Science | 2005-08-01 | Paper |
| NFA reduction algorithms by means of regular inequalities Theoretical Computer Science | 2005-01-11 | Paper |
| Compact and fast algorithms for safe regular expression search International Journal of Computer Mathematics | 2004-12-29 | Paper |
| scientific article; zbMATH DE number 2053215 (Why is no real title available?) | 2004-03-08 | Paper |
| scientific article; zbMATH DE number 2040906 (Why is no real title available?) | 2004-02-11 | Paper |
Research outcomes over time
This page was built for person: Fabien Coulon
