Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Tome 35 (2001)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Integrating observational and computational features in the specification of state-based, dynamical systems
Cîrstea, Corina
p. 1-29
Many-sorted coalgebraic modal logic : a model-theoretic study
Jacobs, Bart
p. 31-59
A coalgebraic semantics of subtyping
Poll, Erik
p. 61-81
Coalgebras for binary methods : properties of bisimulations and invariants
Tews, Hendrik
p. 83-111
Sommaire du
Fascicule no. 2
A generalisation of entity and referential integrity in relational databases
Levene, Mark
;
Loizou, George
p. 113-127
PAC learning under helpful distributions
Denis, François
;
Gilleron, Rémi
p. 129-148
Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
Bollig, Beate
p. 149-162
On the stack-size of general tries
Bourdon, Jérémie
;
Nebel, Markus
;
Vallée, Brigitte
p. 163-185
On the number of iterations required by Von Neumann addition
Grübel, Rudolf
;
Reimers, Anke
p. 187-206
Sommaire du
Fascicule no. 3
Les types de données syntaxiques du système
ℱ
Farkh, Samir
;
Nour, Karim
p. 207-221
Les
I
-types du système
ℱ
Nour, K.
p. 223-237
Number-conserving reversible cellular automata and their computation-universality
Morita, Kenichi
;
Imai, Katsunobu
p. 239-258
Division in logspace-uniform
NC
1
Chiu, Andrew
;
Davida, George
;
Litow, Bruce
p. 259-275
Depth lower bounds for monotone semi-unbounded fan-in circuits
Johannsen, Jan
p. 277-286
On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
Mishra, Sounaka
;
Sikdar, Kripasindhu
p. 287-309
Sommaire du
Fascicule no. 4
Automata-based representations for infinite graphs
Torre, Salvatore La
;
Napoli, Margherita
p. 311-330
Towards parametrizing word equations
Abdulrab, H.
;
Goralčík, P.
;
Makanin, G. S.
p. 331-350
Maximal circular codes versus maximal codes
Guesnet, Yannick
p. 351-365
The helping hierarchy
Cintioli, Patrizio
;
Silvestri, Riccardo
p. 367-377
On the expressive power of the shuffle operator matched with intersection by regular sets
Jȩdrzejowicz, Joanna
;
Szepietowski, Andrzej
p. 379-388
Atoms and partial orders of infinite languages
Kuich, Werner
;
Sauer, N. W.
p. 389-401
Sommaire du
Fascicule no. 5
On graph products of automatic monoids
Veloso Da Costa, A.
p. 403-417
Commutative images of rational languages and the abelian kernel of a monoid
Delgado, Manuel
p. 419-435
A test-set for
k
-power-free binary morphisms
Wlazinski, F.
p. 437-452
Linear size test sets for certain commutative languages
Holub, Štěpán
;
Kortelainen, Juha
p. 453-475
Note on the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata
Mereghetti, Carlo
;
Palano, Beatrice
;
Pighizzini, Giovanni
p. 477-490
Sommaire du
Fascicule no. 6
An exercise on Fibonacci representations
Berstel, Jean
p. 491-498
Random generation for finitely ambiguous context-free languages
Bertoni, Alberto
;
Goldwurm, Massimiliano
;
Santini, Massimo
p. 499-512
On synchronized sequences and their separators
Carpi, Arturo
;
Maggi, Cristiano
p. 513-524
Periodicity and roots of transfinite strings
Carton, Olivier
;
Choffrut, Christian
p. 525-533
On conjugacy of languages
Cassaigne, Julien
;
Karhumäki, Juhani
;
Maňuch, Ján
p. 535-550
A sharpening of the Parikh mapping
Mateescu, Alexandru
;
Salomaa, Arto
;
Salomaa, Kai
;
Yu, Sheng
p. 551-564
Forbidden factors and fragment assembly
Mignosi, F.
;
Restivo, A.
;
Sciortino, M.
p. 565-577
Free burnside semigroups
Do Lago, Alair Pereira
;
Simon, Imre
p. 579-595
A conjecture on the concatenation product
Pin, Jean-Eric
;
Weil, Pascal
p. 597-618