default search action
RAIRO - Theoretical Informatics and Applications, Volume 55
Volume 55, 2021
- Markus Holzer, José M. Sempere:
Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019). 1-2 - Josef Rukavicka:
Upper bound for palindromic and factor complexity of rich words. 1-15 - Anne Ruimy:
Publisher's Note. 1-2 - Vinh Duc Tran, Igor Litovsky:
One-relation languages and code generators. 1-26 - Daniel Gabric, Jeffrey O. Shallit:
The simplest binary word with only three squares. 1-7 - Samira Attou, Ludovic Mignot, Djelloul Ziadi:
Bottom-Up derivatives of tree expressions. 1-21 - Benedek Nagy, Zita Kovács:
On deterministic 1-limited 5′ → 3′ sensing Watson-Crick finite-state transducers. 1-18 - Martin Kutrib, Andreas Malcher:
Digging input-driven pushdown automata. 1-19 - Jens Bruchertseifer, Henning Fernau:
Synchronizing series-parallel deterministic finite automata with loops and related problems. 1-24 - Jürgen Dassow, Bianca Truthe:
Accepting networks of evolutionary processors with resources restricted and structure limited filters. 1-27 - Frantisek Mráz, Friedrich Otto:
On restarting automata with auxiliary symbols and small window size. 1-31 - Roumaissa Mahdjoubi, Pierre-Louis Cayrel, Sedat Akleylek, Kenza Guenda:
A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes. 1-16
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.