495 search results - page 63 / 99 » Automata and differentiable words |
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
Quantum dot Cellular Automata (QCA) is one of the promising technologies for nano scale implementation. The operation of QCA systems is based on a new paradigm generally referred ...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
CAV
2010
Springer
13 years 11 months ago
2010
Springer
Formal specifications play an increasingly important role in system design-flows. Yet, they are not always easy to deal with. In this paper we present RATSY, a successor of the R...