Sommaire

Learning deterministic regular grammars from stochastic samples in polynomial time

Carrasco, Rafael C. ; Oncina, José

Access to full text
Full (PDF)
Full (DJVU)
p. 1-19

Numdam
Preface

ITA

Access to full text
Full (PDF)
Full (DJVU)
p. 9

Numdam
On the complexity of the hidden weighted bit function for various BDD models

Bollig, Beate ; Löbbing, Martin ; Sauerhoff, Martin ; Wegener, Ingo

Access to full text
Full (PDF)
Full (DJVU)
p. 103-115

Numdam
Unavoidable set : extension and reduction

Phan Trung Huy ; Nguyen Huong Lam

Access to full text
Full (PDF)
Full (DJVU)
p. 213-225

Numdam
Computing the Rabin index of a parity automaton

Carton, Olivier ; Maceiras, Ramón

Access to full text
Full (PDF)
Full (DJVU)
p. 495-505

Numdam
On the influence of the state encoding on OBDD-representations of finite state machines

Meinel, Christoph ; Theobald, Thorsten

Access to full text
Full (PDF)
Full (DJVU)
p. 21-31

Numdam
Undecidability of the equivalence of finite substitutions on regular language

Halava, Vesa ; Harju, Tero

Access to full text
Full (PDF)
Full (DJVU)
p. 117-124

Numdam
Normalisation of the theory 𝐓 of Cartesian closed categories and conservativity of extensions mathbfT[x] of mathbfT

Preller, Anne ; Duroux, P.

Access to full text
Full (PDF)
Full (DJVU)
p. 227-257

Numdam
Monotone (co)inductive types and positive fixed-point types

Matthes, Ralph

Access to full text
Full (PDF)
Full (DJVU)
p. 309-328

Numdam
Call-by-value solvability

Paolini, Luca ; Ronchi Della Rocca, Simona

Access to full text
Full (PDF)
Full (DJVU)
p. 507-534

Numdam
On the average case complexity of some P-complete problems

Serna, Maria ; Xhafa, Fatos

Access to full text
Full (PDF)
Full (DJVU)
p. 33-45

Numdam
On sequences defined by D0L power series

Honkala, Juha

Access to full text
Full (PDF)
Full (DJVU)
p. 125-132

Numdam
On existentially first-order definable languages and their relation to NP

Borchert, Bernd ; Kuske, Dietrich ; Stephan, Frank

Access to full text
Full (PDF)
Full (DJVU)
p. 259-269

Numdam
The μ-calculus alternation-depth hierarchy is strict on binary trees

Arnold, André

Access to full text
Full (PDF)
Full (DJVU)
p. 329-339

Numdam
Universality of reversible hexagonal cellular automata

Morita, Kenichi ; Margenstern, Maurice ; Imai, Katsunobu

Access to full text
Full (PDF)
Full (DJVU)
p. 535-550

Numdam
Strongly locally testable semigroups with commuting idempotents and related languages

Selmi, Carla

Access to full text
Full (PDF)
Full (DJVU)
p. 47-57

Numdam
Construction of a deterministic ω-automaton using derivatives

Redziejowski, Roman R.

Access to full text
Full (PDF)
Full (DJVU)
p. 133-158

Numdam
There is no complete axiom system for shuffle expressions

Szepietowski, A.

Access to full text
Full (PDF)
Full (DJVU)
p. 271-277

Numdam
Fixpoint alternation : arithmetic, transition systems, and the binary tree

Bradfield, J. C.

Access to full text
Full (PDF)
Full (DJVU)
p. 341-356

Numdam
Calculs d'invariants primitifs de groupes finis

Abdeljaouad, Ines

Access to full text
Full (PDF)
Full (DJVU)
p. 59-77

Numdam
Immunity and simplicity for exact counting and other counting classes

Rothe, J.

Access to full text
Full (PDF)
Full (DJVU)
p. 159-176

Numdam
Non-looping string rewriting

Geser, Alfons ; Zantema, Hans

Access to full text
Full (PDF)
Full (DJVU)
p. 279-301

Numdam
Topologies, continuity and bisimulations

Davoren, J. M.

Access to full text
Full (PDF)
Full (DJVU)
p. 357-381

Numdam
On-line finite automata for addition in some numeration systems

Frougny, Christiane

Access to full text
Full (PDF)
Full (DJVU)
p. 79-101

Numdam
On the median-of-k version of Hoare’s selection algorithm

Grübel, Rudolf

Access to full text
Full (PDF)
Full (DJVU)
p. 177-192

Numdam
Lower space bounds for accepting shuffle languages

Szepietowski, Andrzej

Access to full text
Full (PDF)
Full (DJVU)
p. 303-307

Numdam
A note on negative tagging for least fixed-point formulae

Gurov, Dilian ; Kapron, Bruce

Access to full text
Full (PDF)
Full (DJVU)
p. 383-392

Numdam
Communication complexity and lower bounds on multilective computations

Hromkovič, Juraj

Access to full text
Full (PDF)
Full (DJVU)
p. 193-212

Numdam
A note on coinduction and weak bisimilarity for while programs

Rutten, J. J. M. M.

Access to full text
Full (PDF)
Full (DJVU)
p. 393-400

Numdam
Final dialgebras : from categories to allegories

Backhouse, Roland ; Hoogendijk, Paul

Access to full text
Full (PDF)
Full (DJVU)
p. 401-426

Numdam
On distributive fixed-point expressions

Seidl, Helmut ; NiwiŃski, Damian

Access to full text
Full (PDF)
Full (DJVU)
p. 427-446

Numdam
A finite axiomatization of nondeterministic regular expressions

Corradini, Flavio ; De Nicola, Rocco ; Labella, Anna

Access to full text
Full (PDF)
Full (DJVU)
p. 447-465

Numdam
Rewriting on cyclic structures : equivalence between the operational and the categorical description

Corradini, Andrea ; Gadducci, Fabio

Access to full text
Full (PDF)
Full (DJVU)
p. 467-493

Numdam