- Emmanuel Filiot, Sarah Winter. Synthesizing Computable Functions from Rational Specifications Over Infinite Words. Int. J. Found. Comput. Sci., 35(1&2):179-214, January & February 2024.
- Manfred Droste, Gustav Grabolle, George Rahonis. Weighted Linear Dynamic Logic. Int. J. Found. Comput. Sci., 35(1&2):145-177, January & February 2024.
- Paula Steinby. In Memoriam: Magnus Steinby (1941-2021). Int. J. Found. Comput. Sci., 35(1&2):3-5, January & February 2024.
- Henrik Björklund, Johanna Björklund, Petter Ericson. Tree-Based Generation of Restricted Graph Languages. Int. J. Found. Comput. Sci., 35(1&2):215-243, January & February 2024.
- Andreas Maletti. Compositions of Weighted Extended Tree Transducers - The Unambiguous Case. Int. J. Found. Comput. Sci., 35(1&2):107-127, January & February 2024.
- Tero Harju. A Note on Squares in Binary Words. Int. J. Found. Comput. Sci., 35(1&2):101-106, January & February 2024.
- Vesa Halava, Stepan Holub. Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time. Int. J. Found. Comput. Sci., 35(1&2):129-144, January & February 2024.
- Zoltán Fülöp 0001, George Rahonis, Kai Salomaa. Special Issue: Articles Dedicated to the Memory of Magnus Steinby - Preface. Int. J. Found. Comput. Sci., 35(1&2):1, January & February 2024.
- Zoltán Fülöp 0001, Heiko Vogler. A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices. Int. J. Found. Comput. Sci., 35(1&2):51-76, January & February 2024.
- Pierre Béaur, Jarkko Kari. Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata. Int. J. Found. Comput. Sci., 35(1&2):77-100, January & February 2024.