1052 search results - page 152 / 211 » The Regular Real-Time Languages |
129
Voted
ECCC
2008
15 years 3 months ago
2008
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
122
Voted
ACTA
2005
15 years 3 months ago
2005
It is known that LTL formulae without the `next' operator are invariant under the so-called stutter-equivalence of words. In this paper we extend this principle to general LTL...
126
Voted
TCS
2008
15 years 3 months ago
2008
We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functionalimpe...
135
Voted
IFIP
2010
Springer
15 years 2 months ago
2010
Springer
In order to enhance the active life of senior professionals, one fundamental challenge is to identify ways to assist promoting the role of elder people within the continuously agei...
135
Voted
PPDP
2010
Springer
15 years 2 months ago
2010
Springer
Program Synthesis, which is the task of discovering programs that realize user intent, can be useful in several scenarios: enabling people with no programming background to develo...