Int. J. Found. Comput. Sci.

Keyphrases

Publications

volume 35, number 1&2, 2024

Manfred Droste, Gustav Grabolle, George Rahonis
Weighted Linear Dynamic Logic. Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Emmanuel Filiot, Sarah Winter
Synthesizing Computable Functions from Rational Specifications Over Infinite Words. Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Paula Steinby
In Memoriam: Magnus Steinby (1941-2021). Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Arto Salomaa, Magnus Steinby
Volume Edited by Magnus Steinby. Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Henrik Björklund, Johanna Björklund, Petter Ericson
Tree-Based Generation of Restricted Graph Languages. Int. J. Found. Comput. Sci. 35 (1&2) (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) (2024)
Zoltán Fülöp, 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) (2024)
Zoltán Fülöp, George Rahonis, Kai Salomaa
Special Issue: Articles Dedicated to the Memory of Magnus Steinby - Preface. Int. J. Found. Comput. Sci. 35 (1&2) (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) (2024)
Christof Löding, Wolfgang Thomas
On the Boolean Closure of Deterministic Top-Down Tree Automata. Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Tero Harju
A Note on Squares in Binary Words. Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Andreas Maletti
Compositions of Weighted Extended Tree Transducers - The Unambiguous Case. Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Erik Paul
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata. Int. J. Found. Comput. Sci. 35 (1&2) (2024)

volume 35, number 3, 2024

volume 34, number 4, 2023

volume 34, number 5, 2023

volume 34, number 6, 2023

volume 34, number 7, 2023

volume 34, number 8, 2023