493 search results - page 1 / 99 » Alternating Weighted Automata |
FCT
2009
Springer
13 years 11 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
ATVA
2011
Springer
12 years 4 months ago
2011
Springer
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...
CONCUR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
CDC
2008
IEEE
13 years 11 months ago
2008
IEEE
— It has been established in the literature that the cascade interconnection of two bilinear systems does not in general produce another bilinear system. The goals of this paper ...
MFCS
2001
Springer
13 years 9 months ago
2001
Springer
We describe an explicit simulation of 2-way nondeterministic automata by 1-way alternating automata with quadratic blow-up. We first describe the construction for automata on fin...