Works matching IS 01290541 AND DT 2024 AND VI 35 AND IP 1/2
Results: 13
A Note on Squares in Binary Words.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 1/2, p. 101, doi. 10.1142/S0129054123480052
- By:
- Publication type:
- Article
Volume Edited by Magnus Steinby.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 1/2, p. 7, doi. 10.1142/S0129054123760018
- By:
- Publication type:
- Article
Synthesizing Computable Functions from Rational Specifications Over Infinite Words.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 1/2, p. 179, doi. 10.1142/S012905412348009X
- By:
- Publication type:
- Article
Weighted Linear Dynamic Logic.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 1/2, p. 145, doi. 10.1142/S0129054123480088
- By:
- Publication type:
- Article
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 1/2, p. 129, doi. 10.1142/S0129054123480076
- By:
- Publication type:
- Article
Compositions of Weighted Extended Tree Transducers — The Unambiguous Case.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 1/2, p. 107, doi. 10.1142/S0129054123480064
- By:
- Publication type:
- Article
Tree-Based Generation of Restricted Graph Languages.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 1/2, p. 215, doi. 10.1142/S0129054123480106
- By:
- Publication type:
- Article
Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 1/2, p. 77, doi. 10.1142/S0129054123480040
- By:
- Publication type:
- Article
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 1/2, p. 51, doi. 10.1142/S0129054123480039
- By:
- Publication type:
- Article
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 1/2, p. 23, doi. 10.1142/S0129054123480027
- By:
- Publication type:
- Article
On the Boolean Closure of Deterministic Top-Down Tree Automata.
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 1/2, p. 11, doi. 10.1142/S0129054123480015
- By:
- Publication type:
- Article
In Memoriam: Magnus Steinby (1941–2021).
- Published in:
- International Journal of Foundations of Computer Science, 2024, v. 35, n. 1/2, p. 3, doi. 10.1142/S0129054123200010
- By:
- Publication type:
- Article
Special Issue: Articles Dedicated to the Memory of Magnus Steinby — Preface.
- Published in:
- 2024
- By:
- Publication type:
- Editorial