762 search results - page 81 / 153 » Intercode Regular Languages |
118
click to vote
BIRTHDAY
1997
Springer
15 years 8 months ago
1997
Springer
We study a Lindenmayer-like parallel rewriting system to model the growth of filaments (arrays of cells) in which developmental errors may occur. In essence this model is the fuzz...
144
click to vote
IJAC
2008
15 years 4 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...
124
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 ...
127
click to vote
IPL
2006
15 years 4 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....
139
click to vote
FCT
2001
Springer
15 years 8 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 ...