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="Boigelot, Bernard"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A generalization of Cobham's theorem to automata over real numbers
Bernard Boigelot
,
Julien Brusten
Theoretical Computer Science
410
(18), 2009, pp. 1694-1703
On the sets of real numbers recognized by finite automata in multiple bases
Bernard Boigelot
,
Julien Brusten
,
Véronique Bruyère
Lecture Notes in Computer Science
5126
, 2008, pp. 112-123
A generalization of Cobham's theorem to automata over real numbers
Bernard Boigelot
,
Julien Brusten
Lecture Notes in Computer Science
4596
, 2007, pp. 813-824
Counting the solutions of Presburger equations without enumerating them
Bernard Boigelot
,
Louis Latour
Theoretical Computer Science
313
(1), 2004, pp. 17-29
On iterating linear transformations over recognizable sets of integers
Bernard Boigelot
Theoretical Computer Science
309
(1-3), 2003, pp. 413-468
On the expressiveness of real and integer arithmetic automata
Bernard Boigelot
,
Stéphane Rassart
,
Pierre Wolper
Lecture Notes in Computer Science
1443
, 1998, pp. 152-163