- Martin Kutrib, Uwe Meyer 0003. Reversible Top-Down Syntax Analysis. Int. J. Found. Comput. Sci., 34(2&3):225-251, February & April 2023.
- Mikhail Mrykhin, Alexander Okhotin. The Hardest LL(k) Language. Int. J. Found. Comput. Sci., 34(2&3):289-319, February & April 2023.
- Viktor Henriksson, Manfred Kufleitner. 2 Alternation Over Finite and Infinite Words. Int. J. Found. Comput. Sci., 34(2&3):183-224, February & April 2023.
- Fabian Frei, Juraj Hromkovic, Rastislav Královic, Richard Královic. Two-Way Non-Uniform Finite Automata. Int. J. Found. Comput. Sci., 34(2&3):145-162, February & April 2023.
- Luc Edixhoven, Sung-Shik Jongmans. Balanced-by-Construction Regular and ω-Regular Languages. Int. J. Found. Comput. Sci., 34(2&3):117-144, February & April 2023.
- Mingzu Zhang, Hongxi Liu, Pingping Li. Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks. Int. J. Found. Comput. Sci., 34(1):1-10, January 2023.
- Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov. Integer Weighted Automata on Infinite Words. Int. J. Found. Comput. Sci., 34(2&3):163-182, February & April 2023.
- Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya. Optimal Gathering Over Weber Meeting Nodes in Infinite Grid. Int. J. Found. Comput. Sci., 34(1):25-49, January 2023.
- Loris Marchal, Samuel McCauley, Bertrand Simon, Frédéric Vivien. Minimizing I/Os in Out-of-Core Task Tree Scheduling. Int. J. Found. Comput. Sci., 34(1):51-80, January 2023.
- Sebastian Maneth, Helmut Seidl, Martin Vu. Definability Results for Top-Down Tree Transducers. Int. J. Found. Comput. Sci., 34(2&3):253-287, February & April 2023.