Tome 33 (1999) no. 1

Sommaire

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