Revues
Séminaires
Livres
Notes de cours
Thèses
Auteurs
OFF
Revues
Séminaires
Livres
Notes de cours
Thèses
Auteurs
Tout
Tout
Auteur
Titre
Bibliographie
Mots clés
Plein texte
Rechercher
NOT
Entre
et
Auteur
Tout
Auteur
Titre
Date
Bibliographie
Mots clés
Plein texte
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Tome 33 (1999)
Sommaire du
Fascicule no. 1
Learning deterministic regular grammars from stochastic samples in polynomial time
Carrasco, Rafael C.
;
Oncina, José
p. 1-19
On the influence of the state encoding on OBDD-representations of finite state machines
Meinel, Christoph
;
Theobald, Thorsten
p. 21-31
On the average case complexity of some P-complete problems
Serna, Maria
;
Xhafa, Fatos
p. 33-45
Strongly locally testable semigroups with commuting idempotents and related languages
Selmi, Carla
p. 47-57
Calculs d'invariants primitifs de groupes finis
Abdeljaouad, Ines
p. 59-77
On-line finite automata for addition in some numeration systems
Frougny, Christiane
p. 79-101
Sommaire du
Fascicule no. 2
On the complexity of the hidden weighted bit function for various BDD models
Bollig, Beate
;
Löbbing, Martin
;
Sauerhoff, Martin
;
Wegener, Ingo
p. 103-115
Undecidability of the equivalence of finite substitutions on regular language
Halava, Vesa
;
Harju, Tero
p. 117-124
On sequences defined by D0L power series
Honkala, Juha
p. 125-132
Construction of a deterministic
ω
-automaton using derivatives
Redziejowski, Roman R.
p. 133-158
Immunity and simplicity for exact counting and other counting classes
Rothe, J.
p. 159-176
On the median-of-
k
version of Hoare’s selection algorithm
Grübel, Rudolf
p. 177-192
Communication complexity and lower bounds on multilective computations
Hromkovič, Juraj
p. 193-212
Sommaire du
Fascicule no. 3
Unavoidable set : extension and reduction
Phan Trung Huy
;
Nguyen Huong Lam
p. 213-225
Normalisation of the theory
𝐓
of Cartesian closed categories and conservativity of extensions
m
a
t
h
b
f
T
[
x
]
of
m
a
t
h
b
f
T
Preller, Anne
;
Duroux, P.
p. 227-257
On existentially first-order definable languages and their relation to NP
Borchert, Bernd
;
Kuske, Dietrich
;
Stephan, Frank
p. 259-269
There is no complete axiom system for shuffle expressions
Szepietowski, A.
p. 271-277
Non-looping string rewriting
Geser, Alfons
;
Zantema, Hans
p. 279-301
Lower space bounds for accepting shuffle languages
Szepietowski, Andrzej
p. 303-307
Sommaire du
Fascicule no. 4-5
Preface
ITA
p. 9
Monotone (co)inductive types and positive fixed-point types
Matthes, Ralph
p. 309-328
The
μ
-calculus alternation-depth hierarchy is strict on binary trees
Arnold, André
p. 329-339
Fixpoint alternation : arithmetic, transition systems, and the binary tree
Bradfield, J. C.
p. 341-356
Topologies, continuity and bisimulations
Davoren, J. M.
p. 357-381
A note on negative tagging for least fixed-point formulae
Gurov, Dilian
;
Kapron, Bruce
p. 383-392
A note on coinduction and weak bisimilarity for while programs
Rutten, J. J. M. M.
p. 393-400
Final dialgebras : from categories to allegories
Backhouse, Roland
;
Hoogendijk, Paul
p. 401-426
On distributive fixed-point expressions
Seidl, Helmut
;
NiwiŃski, Damian
p. 427-446
A finite axiomatization of nondeterministic regular expressions
Corradini, Flavio
;
De Nicola, Rocco
;
Labella, Anna
p. 447-465
Rewriting on cyclic structures : equivalence between the operational and the categorical description
Corradini, Andrea
;
Gadducci, Fabio
p. 467-493
Sommaire du
Fascicule no. 6
Computing the Rabin index of a parity automaton
Carton, Olivier
;
Maceiras, Ramón
p. 495-505
Call-by-value solvability
Paolini, Luca
;
Ronchi Della Rocca, Simona
p. 507-534
Universality of reversible hexagonal cellular automata
Morita, Kenichi
;
Margenstern, Maurice
;
Imai, Katsunobu
p. 535-550