76 search results - page 7 / 16 » Weak Alternating Automata and Tree Automata Emptiness |
ACL
1997
13 years 11 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
FORMATS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
FOCS
2005
IEEE
14 years 3 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...
FSTTCS
2004
Springer
14 years 3 months ago
2004
Springer
CORR
2008
Springer
13 years 9 months ago
2008
Springer