Abstract is missing.
- P Automata: New ideas and resultsRudolf Freund. 13-40
- Weighted tree automata and their characterization by logic - a summaryZoltán Fülöp. 41-46
- Networks of picture processorsVictor Mitrana. 47-60
- Pattern formations with broadcasting automata modelIgor Potapov. 61-73
- Two-way frequency finite automataKaspars Balodis, Maksims Dimitrijevs, Abuzer Yakaryilmaz. 75-88
- Diving into the queueSimon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt. 89-104
- On the dissimilarity operation on finite languagesCezar Câmpeanu, Nelma Moreira, Rogério Reis. 105-120
- Square on closed languagesKristína Cevorová. 121-130
- Uncountable classical and quantum complexity classesMaksims Dimitrijevs, Abuzer Yakaryilmaz. 131-146
- Combined operations on prefix-free and suffix-free languagesHae-Sung Eom, Matús Palmovský. 147-162
- On bonded sequential and parallel insertion systemsFong Wan Heng, Markus Holzer 0001, Bianca Truthe, Sherzod Turaev, Ahmad Firdaus Yosman. 163-178
- Concatenation on deterministic and alternating automataMichal Hospodár, Galina Jirásková. 179-194
- On double-jumping finite automataRadim Kocman, Zbynek Krivka, Alexander Meduna. 195-210
- Generating error control codes with automata and transducersStavros Konstantinidis, Nelma Moreira, Rogério Reis. 211-226
- Expressive capacity of subregular expressionsMartin Kutrib, Matthias Wendlandt. 227-242
- Regular and linear permutation languagesGrzegorz Madejski. 243-258
- Cyclically extended variants of Sgraffito and restarting automata for picture languagesFriedrich Otto, Frantisek Mráz. 259-273
- Networks of polarized evolutionary processors with elementary polarization of symbolsStefan Popescu. 275-285
- Language classes associated with automata over matrix groupsÖzlem Salehi, Flavio D'Alessandro, A. C. Cem Say. 287-300