
Jürgen Dassow,
Florin Manea:
Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication. ... 68-77
Zoltán Ésik:
Representing Small Ordinals by Finite Automata. ... 78-87
Ondrej Klíma,
Libor Polák:
Descriptional Complexity of the Languages KaL: Automata, Monoids and Varieties. ... 130-138
Xiaoxue Piao,
Kai Salomaa:
Transformations Between Different Types of Unranked Bottom-Up Tree Automata. ... 159-168
Bianca Truthe:
On the Descriptional Complexity of Limited Propagating Lindenmayer Systems. ... 177-188
Yo-Sub Han,
Kai Salomaa:
Nondeterministic State Complexity for Suffix-Free Regular Languages. ... 189-196
Anna Kasprzik:
Learning Residual Finite-State Automata Using Observation Tables. ... 205-212