Geodesic

Sommaire du Fascicule no. 1

Learning deterministic regular grammars from stochastic samples in polynomial time
p. 1-19
On the influence of the state encoding on OBDD-representations of finite state machines
p. 21-31
On the average case complexity of some P-complete problems
p. 33-45
Strongly locally testable semigroups with commuting idempotents and related languages
p. 47-57
Calculs d'invariants primitifs de groupes finis
p. 59-77
On-line finite automata for addition in some numeration systems
p. 79-101

Sommaire du Fascicule no. 2

On the complexity of the hidden weighted bit function for various BDD models
p. 103-115
Undecidability of the equivalence of finite substitutions on regular language
p. 117-124
On sequences defined by D0L power series
p. 125-132
Construction of a deterministic ω-automaton using derivatives
p. 133-158
Immunity and simplicity for exact counting and other counting classes
p. 159-176
On the median-of-k version of Hoare’s selection algorithm
p. 177-192
Communication complexity and lower bounds on multilective computations
p. 193-212

Sommaire du Fascicule no. 3

Unavoidable set : extension and reduction
p. 213-225
Normalisation of the theory 𝐓 of Cartesian closed categories and conservativity of extensions mathbfT[x] of mathbfT
p. 227-257
On existentially first-order definable languages and their relation to NP
p. 259-269
There is no complete axiom system for shuffle expressions
p. 271-277
Non-looping string rewriting
p. 279-301
Lower space bounds for accepting shuffle languages
p. 303-307

Sommaire du Fascicule no. 4-5

Preface
ITA
p. 9
Monotone (co)inductive types and positive fixed-point types
p. 309-328
The μ-calculus alternation-depth hierarchy is strict on binary trees
p. 329-339
Fixpoint alternation : arithmetic, transition systems, and the binary tree
p. 341-356
Topologies, continuity and bisimulations
p. 357-381
A note on negative tagging for least fixed-point formulae
p. 383-392
A note on coinduction and weak bisimilarity for while programs
p. 393-400
Final dialgebras : from categories to allegories
p. 401-426
On distributive fixed-point expressions
p. 427-446
A finite axiomatization of nondeterministic regular expressions
p. 447-465
Rewriting on cyclic structures : equivalence between the operational and the categorical description
p. 467-493

Sommaire du Fascicule no. 6

Computing the Rabin index of a parity automaton
p. 495-505
Call-by-value solvability
p. 507-534
Universality of reversible hexagonal cellular automata
p. 535-550