-
Sergey Afonin, Elena Hazova, Alexander Shundeev.
On regular language factorisation: a complete solution for unary case
-
Henning Bordihn and Henning Fernau.
On the degree of parallelism
-
Richard Bonner, Rusin Freivalds and Zigmars Rasscevskis.
Size of finite probabilistic and quantum automata
-
Liliana Cojocaru.
Communication complexity classes for distributed
generation of languages
-
S'andor Horv'ath and Manfred Kudlek.
A full range of continuum many non-context-free languages with strong
iteration
-
Manfred Kudlek and Roxana Melinte.
On black hole languages
-
Gerhard Lischke.
Restoration of punctured languages
-
Benedek Nagy.
A normal form for regular expressions
-
Daniel Prusa.
Two-dimensional grammars in context-free form: undecidability of
emptiness problem
-
Stefan Raeymaekers Maurice Bruynooghe.
Minimization of finite unranked tree automata
-
Jiri Wiedermann.
Self-reproduction by self-assembly and fission