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
[2]
Hilfe
Suche: Author="Bruy{\`{e}}re, V{\'{e}}ronique"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cumulative defect
Véronique Bruyère
Theoretical Computer Science
292
(1), 2003, pp. 97-109
Automata on linear orderings
Véronique Bruyère
,
Olivier Carton
Lecture Notes in Computer Science
2136
, 2001, pp. 236-247
Maximal bifix codes
Véronique Bruyère
,
Dominique Perrin
Theoretical Computer Science
218
(1), 1999, pp. 107-121
A proof of Choffrut's theorem on subsequential functions
Véronique Bruyère
,
Christoph Reutenauer
Theoretical Computer Science
215
(1-2), 1999, pp. 329-335
The meet operation in the lattice of codes
Véronique Bruyère
,
Denis Derencourt
,
Michel Latteux
Theoretical Computer Science
191
(1-2), 1998, pp. 117-129
On maximal codes with bounded synchronization delay
Véronique Bruyère
Theoretical Computer Science
204
(1-2), 1998, pp. 11-28
Bertrand numeration systems and recognizability
Véronique Bruyère
,
Georges Hansel
Theoretical Computer Science
181
(1), 1997, pp. 17-43
A completion algorithm for codes with bounded synchronization delay
Véronique Bruyère
Lecture Notes in Computer Science
1256
, 1997, pp. 87-97
Variable-length maximal codes
Véronique Bruyère
,
Michel Latteux
Lecture Notes in Computer Science
1099
, 1996, pp. 24-47
On some decision problems for trace codings
Véronique Bruyère
,
Clelia de Felice
,
Giovanna Guaiana
Theoretical Computer Science
148
(2), 1995, pp. 227-260
Recognizable sets of numbers in nonstandard bases
Véronique Bruyère
,
Georges Hansel
Lecture Notes in Computer Science
911
, 1995, pp. 167-179
Synchronization and decomposability for a family of codes
Véronique Bruyère
,
Clelia de Felice
International Journal of Algebra and Computation
2
(4), 1992, pp. 367-393