Subscriber Authentication Point

EDPS Account

Volume 55 (2021)

Free Access to the whole issue

RAIRO - Theoretical Informatics and Applications articles are available online as soon as the production process is complete.
The currently opened issue will be updated regularly until it is complete. To keep abreast of new articles, you may either visit this page regularly or subscribe to our E-mail alert

RAIRO - Theoretical Informatics and Applications

Volume 55 (2021) (open volume)

Export the citation of the selected articles Export
Select all

11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019)

Open Access

Editorial

Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019) E1

Markus Holzer and José M. Sempere

Published online: 22 July 2021

DOI: https://doi.org/10.1051/ita/2021009

PDF (135.3 KB)

Open Access

Bottom-Up derivatives of tree expressions 4

Samira Attou, Ludovic Mignot and Djelloul Ziadi

Published online: 22 July 2021

DOI: https://doi.org/10.1051/ita/2021008

Open Access

On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers 5

Benedek Nagy and Zita Kovács

Published online: 22 July 2021

DOI: https://doi.org/10.1051/ita/2021007

Open Access

Digging input-driven pushdown automata 6

Martin Kutrib and Andreas Malcher

Published online: 22 July 2021

DOI: https://doi.org/10.1051/ita/2021006

Open Access

Synchronizing series-parallel deterministic finite automata with loops and related problems 7

Jens Bruchertseifer and Henning Fernau

Published online: 22 July 2021

DOI: https://doi.org/10.1051/ita/2021005

Open Access

Accepting networks of evolutionary processors with resources restricted and structure limited filters 8

Jürgen Dassow and Bianca Truthe

Published online: 22 July 2021

DOI: https://doi.org/10.1051/ita/2021004

Open Access

On restarting automata with auxiliary symbols and small window size 9

František Mráz and Friedrich Otto

Published online: 22 July 2021

DOI: https://doi.org/10.1051/ita/2021003

Free Access

Upper bound for palindromic and factor complexity of rich words 1

Josef Rukavicka

Published online: 20 January 2021

DOI: https://doi.org/10.1051/ita/2020008

Free Access

One-relation languages and code generators 2

Vinh Duc Tran and Igor Litovsky

Published online: 20 April 2021

DOI: https://doi.org/10.1051/ita/2021002

Free Access

The simplest binary word with only three squares 3

Daniel Gabric and Jeffrey Shallit

Published online: 20 April 2021

DOI: https://doi.org/10.1051/ita/2021001