VOLUME 9 | 2004 | NUMBER 1 |
Zoltán Ésik, Zoltán L. Németh: | |
Higher Dimensional Automata | 3–29 |
Zoltán Fülöp, Heiko Vogler: | |
Weighted Tree Transducers | 31–54 |
Ferenc Gécseg, Balázs Imreh: | |
On Definite and Nilpotent DR Tree Languages | 55–60 |
Giovanna Guaiana, Antonio Restivo, Sergio Salemi: | |
On the Trace Product and Some Families of Languages Closed Under Partial Commutations | 61–79 |
Helmut Jürgensen, Stavros Konstantinidis, Nguyen Huong Lâm: | |
Asymptotically Optimal Low-Cost Solid Codes | 81–102 |
Jean Néraud, Carla Selmi: | |
A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A* | 103–110 |
Yasubumi Sakakibara, Hiroshi Imai: | |
A DNA-Based Computational Model Using a Specific Type of Restriction Enzymes | 111–119 |
Nicolae Santean: | |
Bimachines and Structurally-Reversed Automata | 121–146 |
Pascal Weil: | |
On the Logical Definability of Certain Graph and Poset Languages | 147–165 |