default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformatique Théorique et Applications, Volume 41
Volume 41, Number 1, January-March 2007
- Vasco Brattka
, Christiane Frougny, Norbert Th. Müller:
Foreword. 1-2 - Xizhong Zheng:
On the hierarchies of $\Delta^0_2$-real numbers. 3-25 - Benoit Cagnard, Pierre Simonnet:
Automata, Borel functions and real numbers in Pisot base. 27-44 - Stef Graillat, Philippe Langlois:
Real and complex pseudozero sets for polynomials with applications. 45-56 - Guillaume Melquiond, Sylvain Pion:
Formally certified floating-point filters for homogeneous geometric predicates. 57-69 - Nicolas Brisebarre, Jean-Michel Muller:
Correct rounding of algebraic functions. 71-83 - Florent de Dinechin, Christoph Quirin Lauter, Jean-Michel Muller:
Fast and correctly rounded logarithms in double-precision. 85-102 - Laurent Fousse:
Multiple-Precision Correctly rounded Newton-Cotes quadrature. 103-121
Volume 41, Number 2, April-June 2007
- Ondrej Turek:
Balance properties of the fixed point of the substitution associated to quadratic simple Pisot numbers. 123-135 - Ashish Choudhary, Kamala Krithivasan, Victor Mitrana:
Returning and non-returning parallel communicating finite automata are equivalent. 137-145 - Ian Gambini, Laurent Vuillon:
An algorithm for deciding if a polyomino tiles the plane. 147-155 - Tomasz Jurdzinski, Friedrich Otto:
Sequential monotonicity for restarting automata. 157-175 - Martin Lange:
Three notes on the complexity of model checking fixpoint logic with chop. 177-190 - César Domínguez, Laureano Lambán, Julio Rubio:
Object oriented institutions to specify symbolic computation systems. 191-214 - Juha Honkala:
A periodicity property of iterated morphisms. 215-223 - Manfred Schmidt-Schauß, David Sabel, Marko Schütz:
Deciding inclusion of set constants over infinite non-strict data structures. 225-241
Volume 41, Number 3, July-September 2007
- Henning Fernau, Klaus Reinhardt, Ludwig Staiger:
Decidability of code properties. 243-259 - Ira Assent, Sebastian Seibert:
An upper bound for transforming self-verifying automata into deterministic ones. 261-265 - N. Pytheas Fogg:
Substitutions par des motifs en dimension 1. 267-284 - Toke M. Carlsen, Søren Eilers:
A graph approach to computing nondeterminacy in substitutional dynamical systems. 285-306 - L'ubomíra Balková, Edita Pelantová, Ondrej Turek:
Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers. 307-328 - Valérie Berthé, Hiromi Ei, Shunji Ito, Hui Rao:
On substitution invariant Sturmian words: an application of Rauzy fractals. 329-349
Volume 41, Number 4, October-December 2007
- Henning Fernau:
Learning tree languages from text. 351-374 - Hans-Joachim Böckenhauer, Dirk Bongartz:
A weighted HP model for protein folding with diagonal contacts. 375-402 - Wlodzimierz Moczurad:
Defect theorem in the plane. 403-409 - Peter Leupold, Victor Mitrana:
Uniformly bounded duplication codes. 411-424 - Idrissa Kaboré, Théodore Tapsoba:
Combinatoire de mots récurrents de complexité n+2. 425-446 - Jirí Adámek, Dominik Lücke, Stefan Milius:
Recursive coalgebras of finitary functors. 447-462
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-24 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
