- Benedek Nagy, Zita Kovács. On deterministic 1-limited 5′ → 3′ sensing Watson-Crick finite-state transducers. ITA, 55:5, 2021.
- Martin Kutrib, Andreas Malcher. Digging input-driven pushdown automata. ITA, 55:6, 2021.
- Josef Rukavicka. Upper bound for palindromic and factor complexity of rich words. ITA, 55:1, 2021.
- Samira Attou, Ludovic Mignot, Djelloul Ziadi. Bottom-Up derivatives of tree expressions. ITA, 55:4, 2021.
- Jürgen Dassow, Bianca Truthe. Accepting networks of evolutionary processors with resources restricted and structure limited filters. ITA, 55:8, 2021.
- Vinh Duc Tran, Igor Litovsky. One-relation languages and code generators. ITA, 55:2, 2021.
- Daniel Gabric, Jeffrey O. Shallit. The simplest binary word with only three squares. ITA, 55:3, 2021.
- Jens Bruchertseifer, Henning Fernau. Synchronizing series-parallel deterministic finite automata with loops and related problems. ITA, 55:7, 2021.
- Markus Holzer 0001, José M. Sempere. Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019). ITA, 55:1, 2021.
- Anne Ruimy. Publisher's Note. ITA, 55:2, 2021.