Search Results for author:
Found 3 papers, 1 papers with code
Synthesis from Weighted Specifications with Partial Domains over Finite Words
A weighted specification $S$ assigns a rational value (or $-\infty$) to words in $(I\times O)^*$, and we consider three kinds of objectives for synthesis, namely threshold objectives where the system's executions are required to be above some given threshold, best-value and approximate objectives where the system is required to perform as best as it can by providing output symbols that yield the best value and $\varepsilon$-best value respectively w. r. t.
Formal Languages and Automata Theory Computer Science and Game Theory Logic in Computer Science
On finitely ambiguous Büchi automata
Unambiguous B\"uchi automata, i. e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking.
Formal Languages and Automata Theory
Learning MSO-definable hypotheses on string
We study the classification problems over string data for hypotheses specified by formulas of monadic second-order logic MSO.
