234 search results - page 41 / 47 » On Quasi-Products of Tree Automata |
100
click to vote
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
141
click to vote
ITA
2007
15 years 1 months ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
125
click to vote
ESOP
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
127
click to vote
PLANX
2007
15 years 2 months ago
2007
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
104
click to vote
FSTTCS
2010
Springer
14 years 11 months ago
2010
Springer
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...