493 search results - page 32 / 99 » Alternating Weighted Automata |
CORR
2010
Springer
15 years 11 days ago
2010
Springer
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
106
click to vote
AAAI
2008
15 years 5 months ago
2008
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, ...
152
click to vote
CONCUR
1997
Springer
15 years 7 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
238
click to vote
ICDT
2010
ACM
16 years 11 days ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
150
click to vote
LICS
1997
IEEE
15 years 6 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...