493 search results - page 17 / 99 » Alternating Weighted Automata |
HYBRID
1998
Springer
14 years 26 days ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
FCT
2007
Springer
14 years 2 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
FOSSACS
2009
Springer
14 years 15 days ago
2009
Springer
We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes ...
ENTCS
2002
13 years 8 months ago
2002
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...