New representation results for three families of regular languages are stated, using a special kind of shuffle operation, namely the synchronized shuffle. First, it is proved that the family of regular star languages is the smallest family containing the language (a+ bc)∗ and closed under synchronized shuffle and length preserving morphism. The second representation result states that the famil...

The Open Geospatial Consortium (OGC) Geography Markup Language (GML) explicitly represents geographical spatial knowledge in text mode. All kinds of fuzzy problems will inevitably be encountered in spatial knowledge expression. Especially for those expressions in text mode, this fuzziness will be broader. Describing and representing fuzziness in GML seems necessary. Three kinds of fuzziness in ...

Strictly Piecewise (SP) languages are a subclass of regular languages which encode certain kinds of long-distance dependencies that are found in natural languages. Like the classes in the Chomsky and Subregular hierarchies, there are many independently converging characterizations of the SP class (Rogers et al., to appear). Here we define SP distributions and show that they can be efficiently e...

This paper brings together several approaches to vagueness, and ends by suggesting a new approach. The common thread in these approaches is the crucial role played by context. In Section 2, we treat game-theoretic rationales for vagueness, and for the related concepts of ambiguity and generality. Common about these rationales is that they are based on the assumption of a conflict of interest be...

We explore the regular-expression matching problem with respect to prefix-freeness of the pattern. We show that the prefix-free regular expression gives only linear number of matching substrings in the size of a given text. Based on this observation, we propose an efficient algorithm for the prefix-free regular-expression matching problem. Furthermore, we suggest an algorithm to determine wheth...

Abstract Traditionally, graph algorithms get a single as input, and then they should decide if this satisfies certain property $$\varPhi $$ Φ . What happens question is modified in way that we possibly infinite family of graphs an the there satisfying family? We approach by using formal languages for specifyi...

We show that every regular language, via some DFA which accepts it, gives rise to a homomorphism from the semiring of polynomial functors to the semiring of n×n matrices over polynomial functors. Given some polynomial functor and a regular language, this homomorphism can be used to automatically derive a functor whose values have the same shape as those of the original functor, but whose sequen...