VOLUME 13 | 2008 | NUMBER 1 |
Zoltán Fülöp, Loránd Muzamel: | |
Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers | 3–44 |
Sergey Kitaev, Artem Pyatkin: | |
On Representable Graphs | 45–54 |
Stavros Konstantinidis, Pedro V. Silva: | |
Maximal Error-Detecting Capabilities of Formal Languages | 55–71 |
Vadim V. Lozin: | |
Graph Representation Functions Computable by Finite Automata | 73–90 |