Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata

DOI10.1142/s0129054123450041OpenAlexW4386593550MaRDI QIDQ6072403

Zoltán Fülöp, Manfred Droste, Dávid Kószó

Publication date: 13 October 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054123450041

zbMATH Keywords

undecidabilitydecidabilitysemiringweighted finite automatonstrong bimonoidfinite-image property

Mathematics Subject Classification ID

Theory of computing (68Qxx) Semigroups (20Mxx) Special aspects of infinite or finite groups (20Fxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted automata and multi-valued logics over arbitrary bounded lattices
• Handbook of weighted automata
• Weighted finite automata over strong bimonoids
• Determinization of weighted finite automata over strong bimonoids
• Rational languages and the Burnside problem
• On finite semigroups of matrices
• The word problem for one-relation monoids: a survey
• Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable
• What's decidable about weighted automata?
• Weighted automata
• Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
• Undecidability of the word problem for one-relator inverse monoids via right-angled Artin subgroups of one-relator groups
• On the definition of a family of automata
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• The order problem and the power problem for free product sixth-groups

This page was built for publication: Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata