- Giovanni Pighizzini, Luca Prigioniero. Non-Self-Embedding Grammars and Descriptional Complexity. Fundamenta Informaticae, 180(1-2):103-122, 2021.
- Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek. Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference. Fundamenta Informaticae, 178(3):203-227, 2021.
- Qichao Wang. Languages Accepted by Weighted Restarting Automata. Fundamenta Informaticae, 180(1-2):151-177, 2021.
- Toufik Benouhiba. A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models. Fundamenta Informaticae, 179(1):1-33, 2021.
- Zhaohao Wang. A New Description of Transversal Matroids Through Rough Set Approach. Fundamenta Informaticae, 179(4):399-416, 2021.
- Markus Holzer 0001, Martin Kutrib, Friedrich Otto. Two-Sided Strictly Locally Testable Languages. Fundamenta Informaticae, 180(1-2):29-51, 2021.
- Emmanuel Filiot, Pierre-Alain Reynier. Copyful Streaming String Transducers. Fundamenta Informaticae, 178(1-2):59-76, 2021.
- Florian Bruse, Martin Lange, Étienne Lozes. The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic. Fundamenta Informaticae, 178(1-2):1-30, 2021.
- Friedrich Otto. A Complete Taxonomy of Restarting Automata without Auxiliary Symbols. Fundamenta Informaticae, 180(1-2):77-101, 2021.
- Micheal Arockiaraj, J. Nancy Delaila, Jessie Abraham. Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees. Fundamenta Informaticae, 178(3):187-202, 2021.