Vol. 19 No. 2 (2009)

Published: 2009-06-01

Regular articles

Kleene revisited by Suschkewitsch

Jean Marcel Pallo

553-565
- PDF
Weighted automata define a hierarchy of terminating string rewriting systems

Andreas Gebhardt, Johannes Waldmann

295-312
- PDF
Preface

Erzsébet Csuhaj-Varjú, Zoltán Ésik

441-443
- PDF
Complexity of problems concerning reset words for some partial cases of automata

Pavel Martyugin

517-536
- PDF
MAT learners for recognizable tree languages and tree series

Frank Drewes

249-274
- PDF
Weighted and unweighted trace automata

Dietrich Kuske

393-410
- PDF
Alphabetical satisfiability problem for trace equations

Luca Breveglieri

479-497
- PDF
Statistical language models within the algebra of weighted rational languages

Thomas Hanneforth, Kay-Michael Würzner

313-356
- PDF
Languages convex with respect to binary relations, and their closure properties

Thomas Ang, Janusz Brzozowski

445-464
- PDF
On pure multi-pushdown automata that perform complete pushdown pops

Tomáš Masopust, Alexander Meduna

537-552
- PDF
Weighted tree-walking automata

Zoltán Fülöp, Loránd Muzamel

275-293
- PDF
Recognizable tree series with discounting

Eleni Mandrali, George Rahonis

411-439
- PDF
Homomorphisms preserving types of density

Helmut Jürgensen, Ian McQuillan

499-516
- PDF
Preface

Manfred Droste, Heiko Vogler

247
- PDF
Max/plus tree automata for termination of term rewriting

Adam Koprowski, Johannes Waldmann

357-392
- PDF
Counting distinct squares in partial words

Francine Blanchet-Sadri, Robert Mercaş, Geoffrey Scott

465-477
- PDF