759 search results - page 107 / 152 » Overlap-Free Regular Languages |
CSR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
BIRTHDAY
1997
Springer
15 years 1 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...
IJAC
2008
14 years 9 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...
IPL
2006
14 years 9 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....
SAC
1994
ACM
15 years 1 months ago
1994
ACM
In this paper, the interest of fuzzy sets and possibility theory in the context of databases is presented. It is shown that these " notions provide an homogeneous framework f...