Theoretical Informatics and Applications

Informatique théorique et applications

ITA, Vol. 34, N^o 4, 2000

Computing $\epsilon$ -free NFA from regular expressions in $O(n \log^2(n))$ time p.257
C. Hagenah and A. Muscholl
Abstract | References | PDF file (223 Kb)
On the Horton-Strahler number for combinatorial tries p.279
M.E. Nebel
Abstract | References | PDF file (290 Kb)
A Kleene-Schützenberger theorem for Lindenmayerian rational power series p.297
J. Honkala
Abstract | References | PDF file (133 Kb)
Semi-commutations and partial commutations p.307
M. Clerbout, Y. Roos and I. Ryl
Abstract | References | PDF file (256 Kb)