AbstractWe investigate languages consisting of words following one of the given finitely many patterns. The issues concerning such multi-pattern languages are relevant in inductive inference, theory of learning and term rewriting. We obtain results about decidability, characterization, hierarchies and special classes of multi-pattern languages. Some open problems are also presented
The present paper studies a particular collection of classification problems, i.e., the classificati...
Patterns are a very natural way to define formal languages. Suppose you are interested in the langua...
By treating patterns as statements in a two-dimensional language, it is possible to apply linguistic...
AbstractWe investigate languages consisting of words following one of the given finitely many patter...
AbstractWe introduce a model that covers the recent studies on pattern languages (with or without er...
A pattern is a string of constant symbols and variables. The language defined by a pattern p is the...
AbstractAssume a finite alphabet of constant symbols and a disjoint infinite alphabet of variable sy...
AbstractA word p, over the alphabet of variables E, is a pattern of a word w over A if there exists ...
We study the classification of recursive predicates and languages. In particular, we compare the cla...
A word p, over the alphabet of variables E, is a pattern of a word w over A if there exists a non-er...
Abstract. Multiwords are words in which a single symbol can be replaced by a nonempty set of symbols...
Multiwords are words in which a single symbol can be replaced by a nonempty set of symbols. They ext...
Colloque avec actes et comité de lecture.We overview some problems related to pattern languages on w...
AbstractThis paper deals with the inferrability of classes of E-pattern languages–also referred to a...
We introduce two subclasses of regular !-languages called local !-languages and recognizable !-lang...
The present paper studies a particular collection of classification problems, i.e., the classificati...
Patterns are a very natural way to define formal languages. Suppose you are interested in the langua...
By treating patterns as statements in a two-dimensional language, it is possible to apply linguistic...
AbstractWe investigate languages consisting of words following one of the given finitely many patter...
AbstractWe introduce a model that covers the recent studies on pattern languages (with or without er...
A pattern is a string of constant symbols and variables. The language defined by a pattern p is the...
AbstractAssume a finite alphabet of constant symbols and a disjoint infinite alphabet of variable sy...
AbstractA word p, over the alphabet of variables E, is a pattern of a word w over A if there exists ...
We study the classification of recursive predicates and languages. In particular, we compare the cla...
A word p, over the alphabet of variables E, is a pattern of a word w over A if there exists a non-er...
Abstract. Multiwords are words in which a single symbol can be replaced by a nonempty set of symbols...
Multiwords are words in which a single symbol can be replaced by a nonempty set of symbols. They ext...
Colloque avec actes et comité de lecture.We overview some problems related to pattern languages on w...
AbstractThis paper deals with the inferrability of classes of E-pattern languages–also referred to a...
We introduce two subclasses of regular !-languages called local !-languages and recognizable !-lang...
The present paper studies a particular collection of classification problems, i.e., the classificati...
Patterns are a very natural way to define formal languages. Suppose you are interested in the langua...
By treating patterns as statements in a two-dimensional language, it is possible to apply linguistic...
DOI
Add to ORKG