655 search results - page 101 / 131 » Automata, Logic, and XML |
110
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
134
click to vote
DLT
2010
15 years 1 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
CONCUR
2004
Springer
15 years 5 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
LICS
2002
IEEE
15 years 4 months ago
2002
IEEE
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
WETICE
1999
IEEE
15 years 4 months ago
1999
IEEE
The prevailing architecture for web-based applications relies on HTML, HTTP and loosely integrated functional elements, propagating a strong distinction between client and server....