| 1. |
Paul Amblard: The earliest formal language and its associated Finite
State evaluation automaton: Jevons' machine
|
| 2. |
Miklós Bartha and Branislav Cirovic: On some equivalence notions
of synchronous systems
|
| 3. |
Elena Czeizler and Eugen Czeizler: Parallel Communicating
Watson-Crick Automata Systems
|
| 4. |
Mike Domaratzki and Kai Salomaa: Codes Defined by Multiple Sets of
Trajectories
|
| 5. |
Pál Dömösi and Géza Horváth: On Products of Primitive Words
|
| 6. |
Radu Gramatovici and Florin Manea: A CYK-based Parser for Local
Internal Contextual Grammars with Context-Free Choice
|
| 7. |
Dan He and Abdullah N. Arslan: A Fast Algorithm for the Constrained
Multiple Sequence Alignment Problem
|
| 8. |
Masami Ito: Commutative Closure of Languages
|
| 9. |
Miklós Krész: Isomorphically complete systems of soliton automata
|
| 10. |
Werner Kuich: Conway semirings and skew formal power series
|
| 11. |
Michal Kunc: Largest Solutions of Left-Linear Language Inequalities
|
| 12. |
Andreas Maletti: Compositions of Bottom-Up Tree Series Transformations
|
| 13. |
Carlos Martín-Vide and Victor Mitrana: Remarks on Arbitrary
Multiple Pattern Interpretations
|
| 14. |
Zoltán L. Németh: Automata on Infinite Biposets
|
| 15. |
Edward Ochmanski and Krystyna Stawikowska: On closures of
lexicographic star-free languages
|
| 16. |
Alexander Okhotin: On the existence of a Boolean grammar for a
simple programming language
|
| 17. |
F. Otto, F. Mráz and M. Plátek: Degrees of Monotonicity and
Marcus t-Contextual Grammars
|
| 18. |
Jean Marcel Pallo: Rotational tree structures on
binary trees
|
| 19. |
Tatjana Petkovic: Quasi orders, Languages and Algebras
|
| 20. |
Libor Polák: Small Conjunctive Varieties of Regular Languages
|
| 21. |
Bianca Truthe: A Method for Deciding the Finiteness of Synchronous,
Tabled Picture Languages
|