Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Champarnaud, J.-M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Brute force determinization of NFAs by means of state covers
J.-M. Champarnaud
,
F. Coulon
,
T. Paranthoën
International Journal of Foundations of Computer Science
16
(3), 2005, pp. 441-451
Enumerating nondeterministic automata for a given language without constructing the canonical automaton
J.-M. Champarnaud
,
F. Coulon
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1253-1266
Erratum to ''NFA reduction algorithms by means of regular inequalities''
J.-M. Champarnaud
,
F. Coulon
Theoretical Computer Science
347
(1-2), 2005, pp. 437-440
NFA reduction algorithms by means of regular inequalities
J.-M. Champarnaud
,
F. Coulon
Theoretical Computer Science
327
(3), 2004, pp. 241-253
Canonical derivatives, partial derivatives and finite automaton constructions
J.-M. Champarnaud
,
D. Ziadi
Theoretical Computer Science
289
(1), 2002, pp. 137-163
Subset construction complexity for homogeneous automata, position automata and ZPC-structures
J.-M. Champarnaud
Theoretical Computer Science
267
(1-2), 2001, pp. 17-34
A maxmin problem on finite automata
J.-M. Champarnaud
,
J.-E. Pin
Discrete Applied Mathematics
23
, 1989, pp. 91-96