495 search results - page 64 / 99 » Automata and differentiable words |
FCT
2009
Springer
13 years 11 months ago
2009
Springer
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, litt...
BPM
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Many work has been conducted to analyze service choreographies to assert manyfold correctness criteria. While errors can be detected automatically, the correction of defe...
ACL
2004
13 years 9 months ago
2004
Parsing systems which rely on hand-coded linguistic descriptions can only perform adequately in as far as these descriptions are correct and complete. The paper describes an error...
FSTTCS
2008
Springer
13 years 9 months ago
2008
Springer
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...