759 search results - page 81 / 152 » Odometers on Regular Languages |
IJAC
2008
14 years 10 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...
IS
2011
14 years 4 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...
FSTTCS
2007
Springer
15 years 4 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 ...
IPL
2006
14 years 10 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....
FCT
2001
Springer
15 years 2 months ago
2001
Springer
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...