Recognizable Sets with Multiplicities in the Tropical Semiring
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Computation: finite and infinite machines
Computation: finite and infinite machines
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Handbook of Weighted Automata
Energy and mean-payoff games with imperfect information
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
On the complexity of the equivalence problem for probabilistic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Making weighted containment feasible: a heuristic based on simulation and abstraction
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Automatic vandalism detection in wikipedia with active associative classification
TPDL'12 Proceedings of the Second international conference on Theory and Practice of Digital Libraries
Parameterized weighted containment
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Rigorous approximated determinization of weighted automata
Theoretical Computer Science
Formalizing and reasoning about quality
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Decidability of Weak Simulation on One-Counter Nets
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Regular Functions and Cost Register Automata
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Quantitative Monadic Second-Order Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Weighted automata map input words to numerical values. Applications of weighted automata include formal verification of quantitative properties, as well as text, speech, and image processing. In the 90's, Krob studied the decidability of problems on rational series, which strongly relate to weighted automata. In particular, it follows from Krob's results that the universality problem (that is, deciding whether the values of all words are below some threshold) is decidable for weighted automata with weights in N ∪ {∞}, and that the equality problem is undecidable when the weights are in N ∪ {∞}. In this paper we continue the study of the borders of decidability in weighted automata, describe alternative and direct proofs of the above results, and tighten them further. Unlike the proofs of Krob, which are algebraic in their nature, our proofs stay in the terrain of state machines, and the reduction is from the halting problem of a two-counter machine. This enables us to significantly simplify Krob's reasoning and strengthen the results to apply already to a very simple class of automata: all the states are accepting, there are no initial nor final weights, and all the weights are from the set {-1, 0, 1}. The fact we work directly with automata enables us to tighten also the decidability results and to show that the universality problem for weighted automata with weights in N ∪ {∞}, and in fact even with weights in Q≥0 ∪ {∞}, is PSPACE-complete. Our results thus draw a sharper picture about the decidability of decision problems for weighted automata, in both the front of equality vs. universality and the front of the N ∪ {∞} vs. the Z ∪ {∞} domains.