Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees.
- Published in:
- International Journal of Foundations of Computer Science, 2023, v. 34, n. 6, p. 655, doi. 10.1142/S0129054123450053
- By:
- Publication type:
- Article
Works matching IS 01290541 AND DT 2023 AND VI 34 AND IP 6
Results: 6
1
2
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata.
- Published in:
- International Journal of Foundations of Computer Science, 2023, v. 34, n. 6, p. 633, doi. 10.1142/S0129054123450041
- By:
- Publication type:
- Article
3
Fuzzy Propositional Configuration Logics.
- Published in:
- International Journal of Foundations of Computer Science, 2023, v. 34, n. 6, p. 603, doi. 10.1142/S012905412345003X
- By:
- Publication type:
- Article
4
Modelling Uncertainty in Architectures of Parametric Component-Based Systems.
- Published in:
- International Journal of Foundations of Computer Science, 2023, v. 34, n. 6, p. 559, doi. 10.1142/S0129054123450028
- By:
- Publication type:
- Article
5
Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) — Preface.
- Published in:
- International Journal of Foundations of Computer Science, 2023, v. 34, n. 6, p. 537, doi. 10.1142/S0129054123020033
- By:
- Publication type:
- Article
6
Compositions with Constant Weighted Extended Tree Transducers.
- Published in:
- International Journal of Foundations of Computer Science, 2023, v. 34, n. 6, p. 539, doi. 10.1142/S0129054122450010
- By:
- Publication type:
- Article