GEODESIC
Revues
Séminaires
Livres
Congrès
Sources
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Tome 41 (2007)
Sommaire du
Fascicule no. 1
Foreword
Brattka, Vasco
;
Frougny, Christiane
;
Mueller, Norbert
p. 1-2
On the hierarchies of
Δ
2
0
-real numbers
Zheng, Xizhong
p. 3-25
Automata, Borel functions and real numbers in Pisot base
Cagnard, Benoit
;
Simonnet, Pierre
p. 27-44
Real and complex pseudozero sets for polynomials with applications
Graillat, Stef
;
Langlois, Philippe
p. 45-56
Formally certified floating-point filters for homogeneous geometric predicates
Melquiond, Guillaume
;
Pion, Sylvain
p. 57-69
Correct rounding of algebraic functions
Brisebarre, Nicolas
;
Muller, Jean-Michel
p. 71-83
Fast and correctly rounded logarithms in double-precision
Dinechin, Florent de
;
Lauter, Christoph
;
Muller, Jean-Michel
p. 85-102
Multiple-precision correctly rounded Newton-Cotes quadrature
Fousse, Laurent
p. 103-121
Sommaire du
Fascicule no. 2
Balance properties of the fixed point of the substitution associated to quadratic simple Pisot numbers
Turek, Ondřej
p. 123-135
Returning and non-returning parallel communicating finite automata are equivalent
Choudhary, Ashish
;
Krithivasan, Kamala
;
Mitrana, Victor
p. 137-145
An algorithm for deciding if a polyomino tiles the plane
Gambini, Ian
;
Vuillon, Laurent
p. 147-155
Sequential monotonicity for restarting automata
Jurdziński, Tomasz
;
Otto, Friedrich
p. 157-175
Three notes on the complexity of model checking fixpoint logic with chop
Lange, Martin
p. 177-190
Object oriented institutions to specify symbolic computation systems
Domínguez, César
;
Lambán, Laureano
;
Rubio, Julio
p. 191-214
A periodicity property of iterated morphisms
Honkala, Juha
p. 215-223
Deciding inclusion of set constants over infinite non-strict data structures
Schmidt-Schauss, Manfred
;
Sabel, David
;
Schütz, Marko
p. 225-241
Sommaire du
Fascicule no. 3
Decidability of code properties
Fernau, Henning
;
Reinhardt, Klaus
;
Staiger, Ludwig
p. 243-259
An upper bound for transforming self-verifying automata into deterministic ones
Assent, Ira
;
Seibert, Sebastian
p. 261-265
Substitutions par des motifs en dimension 1
Pytheas Fogg, N.
p. 267-284
A graph approach to computing nondeterminacy in substitutional dynamical systems
Carlsen, Toke M.
;
Eilers, Søren
p. 285-306
Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers
Balková, Lubomíra
;
Pelantová, Edita
;
Turek, Ondřej
p. 307-328
On substitution invariant sturmian words : an application of Rauzy fractals
Berthé, Valérie
;
Ei, Hiromi
;
Ito, Shunji
;
Rao, Hui
p. 329-349
Sommaire du
Fascicule no. 4
Learning tree languages from text
Fernau, Henning
p. 351-374
A weighted HP model for protein folding with diagonal contacts
Böckenhauer, Hans-Joachim
;
Bongartz, Dirk
p. 375-402
Defect theorem in the plane
Moczurad, Włodzimierz
p. 403-409
Uniformly bounded duplication codes
Leupold, Peter
;
Mitrana, Victor
p. 411-424
Combinatoire de mots récurrents de complexité
n
+
2
Kaboré, Idrissa
;
Tapsoba, Théodore
p. 425-446
Recursive coalgebras of finitary functors
Adámek, Jiří
;
Lücke, Dominik
;
Milius, Stefan
p. 447-462