1052 search results - page 124 / 211 » The Regular Real-Time Languages |
139
click to vote
IJAC
2008
15 years 3 months ago
2008
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
147
Voted
IS
2011
14 years 10 months ago
2011
We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors...
129
Voted
OOPSLA
2004
Springer
15 years 9 months ago
2004
Springer
In the domain of hard real-time systems, which language is better: C++ or the Real-Time Specification for Java (RTSJ)? Although standard Java provides a more productive programmin...
116
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
We introduce PEP, the Post Embedding Problem, a variant of PCP where one compares strings with the subword relation, and PEPreg , a further variant where solutions are constrained ...
120
Voted
IPL
2006
15 years 3 months ago
2006
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....