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
This paper examines the learnability of a major subclass of E-pattern languages – also known as eras...
Patterns are a very natural way to define formal languages. Suppose you are interested in the langua...
AbstractPatterns are words over an alphabet of constants and variables. New words are created from a...
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...
This paper deals with the inferrability of classes of E-pattern languages—also referred to as extend...
AbstractThis paper deals with the inferrability of classes of E-pattern languages–also referred to a...
A pattern α is a word consisting of constants and variables and it describes the pattern language L(...
A pattern $\alpha$ is a word consisting of constants and variables and the pattern language $L(\alph...
In the present paper, we study the existence of descriptive patterns, i.e. patterns that cover all w...
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...
AbstractWe investigate the inferrability of E-pattern languages (also known as extended or erasing p...
AbstractA word p, over the alphabet of variables E, is a pattern of a word w over A if there exists ...
We contribute new facets to the discussion on the equivalence problem for E-pattern languages (also ...
This paper examines the learnability of a major subclass of E-pattern languages – also known as eras...
Patterns are a very natural way to define formal languages. Suppose you are interested in the langua...
AbstractPatterns are words over an alphabet of constants and variables. New words are created from a...
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...
This paper deals with the inferrability of classes of E-pattern languages—also referred to as extend...
AbstractThis paper deals with the inferrability of classes of E-pattern languages–also referred to a...
A pattern α is a word consisting of constants and variables and it describes the pattern language L(...
A pattern $\alpha$ is a word consisting of constants and variables and the pattern language $L(\alph...
In the present paper, we study the existence of descriptive patterns, i.e. patterns that cover all w...
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...
AbstractWe investigate the inferrability of E-pattern languages (also known as extended or erasing p...
AbstractA word p, over the alphabet of variables E, is a pattern of a word w over A if there exists ...
We contribute new facets to the discussion on the equivalence problem for E-pattern languages (also ...
This paper examines the learnability of a major subclass of E-pattern languages – also known as eras...
Patterns are a very natural way to define formal languages. Suppose you are interested in the langua...
AbstractPatterns are words over an alphabet of constants and variables. New words are created from a...
DOI
Add to ORKG