Free Access to the whole issue

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

• Abstract
• 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

• Abstract
• PDF (485.7 KB)
• References

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

• Abstract
• PDF (585.4 KB)
• References

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

• Abstract
• PDF (491.0 KB)
• References

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

• Abstract
• PDF (683.6 KB)
• References

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

• Abstract
• PDF (590.9 KB)
• References

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

• Abstract
• PDF (561.2 KB)
• References

Open Access

Editorial

Publisher’s Note E2

Anne Ruimy

Published online: 17 September 2021

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

• Abstract
• PDF (176.5 KB)

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

• Abstract
• PDF (419.8 KB)
• References

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

• Abstract
• PDF (473.9 KB)
• References

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

• Abstract
• PDF (318.6 KB)
• References

Open Access

A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes 10

Roumaissa Mahdjoubi, Pierre Louis Cayrel, Sedat Akleylek and Guenda Kenza

Published online: 17 September 2021

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

• Abstract
• PDF (877.3 KB)
• References

Open Access

Complexity issues of perfect secure domination in graphs 11

P. Chakradhar and P. Venkata Subba Reddy

Published online: 28 October 2021

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

• Abstract
• PDF (587.5 KB)
• References