default search action
RAIRO - Theoretical Informatics and Applications, Volume 52
Volume 52, Number 1, January - March 2018
- Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems. 1-21 - Maryam Ghorani:
State hyperstructures of tree automata based on lattice-valued logic. 23-42 - Mircea Parpalea, Nicoleta Avesalon, Eleonor Ciurea:
Minimum parametric flow in time-dependent dynamic networks. 43-53 - Chris Köcher, Dietrich Kuske, Olena Prianychnykova:
The inclusion structure of partially lossy queue monoids and their trace submonoids. 55-86
Volume 52, Numbers 2-3-4, April - December 2018
- Henning Bordihn, Benedek Nagy, György Vaszil:
Preface: Non-classical models of automata and applications VIII. 87-88 - Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Diving into the queue. 89-110 - Maksims Dimitrijevs, Abuzer Yakaryilmaz:
Uncountable classical and quantum complexity classes. 111-126 - Markus Holzer, Bianca Truthe, Ahmad Firdaus Yosman:
On bonded sequential and parallel insertion systems. 127-151 - Michal Hospodár, Galina Jirásková:
The complexity of concatenation on deterministic and alternating finite automata. 153-168 - Stavros Konstantinidis, Nelma Moreira, Rogério Reis:
Randomized generation of error control codes with automata and transducers. 169-184 - Radim Kocman, Zbynek Krivka, Alexander Meduna:
On double-jumping finite automata and their closure properties. 185-199 - Martin Kutrib, Matthias Wendlandt:
Expressive capacity of subregular expressions. 201-218 - Grzegorz Madejski:
Regular and linear permutation languages. 219-234 - Friedrich Otto, Frantisek Mráz:
Automata with cyclic move operations for picture languages. 235-251 - Özlem Salehi, Flavio D'Alessandro, A. C. Cem Say:
Language classes associated with automata over matrix groups. 253-268
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.