Add to ORKGAbstract: We introduce a couple of families of codiable languages and investigate properties of these families as well as interrelationships between dierent families. We also develop an algorithm based on the Earley algorithm to compute the values of the inverse of the Parikh matrix mapping over a codiable context-free language. Finally, an attributed grammar that computes the values of the Parikh matrix mapping is dened
Abstract We introduce an extension of the Parikh mapping called the Parikh -matrix mapping, which ta...
In this paper we introduce a sharpening of the Parikh mapping and investigate its basic properties...
A set T ⊆ L is a Parikh test set of L if c(T) is a test set of c(L). We give a characterization of P...
Parikh matrices have become a useful tool for investigation of subword structure of words. Several g...
The Parikh matrix mapping allows us to describe words using matrices. Whilst compact, this descripti...
A generative grammar called equal matrix grammar which generates a class which meets both context-se...
The notion of the Parikh mapping is generalized by considering numbers of occurrences of segments of...
Parikh matrix is a numerical property of a word on an ordered alphabet. It is used for studying word...
AbstractUsing the fact that the Parikh matrix mapping is not an injective mapping, the paper investi...
The family of vector languages properly contains all context-free languages. For vector languages th...
The Parikh matrix mapping allows us to describe words using matrices. Although compact, this descrip...
Abstract: An n-dimensional vector of natural numbers is said to be prime if the greatest common divi...
The notion of extending Parikh q-matrix with respect to a word instead of an ordered alphabet is int...
Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates so...
AbstractWe introduce the notion of Parikh matrix induced by a word, a natural extension to the notio...
Abstract We introduce an extension of the Parikh mapping called the Parikh -matrix mapping, which ta...
In this paper we introduce a sharpening of the Parikh mapping and investigate its basic properties...
A set T ⊆ L is a Parikh test set of L if c(T) is a test set of c(L). We give a characterization of P...
Parikh matrices have become a useful tool for investigation of subword structure of words. Several g...
The Parikh matrix mapping allows us to describe words using matrices. Whilst compact, this descripti...
A generative grammar called equal matrix grammar which generates a class which meets both context-se...
The notion of the Parikh mapping is generalized by considering numbers of occurrences of segments of...
Parikh matrix is a numerical property of a word on an ordered alphabet. It is used for studying word...
AbstractUsing the fact that the Parikh matrix mapping is not an injective mapping, the paper investi...
The family of vector languages properly contains all context-free languages. For vector languages th...
The Parikh matrix mapping allows us to describe words using matrices. Although compact, this descrip...
Abstract: An n-dimensional vector of natural numbers is said to be prime if the greatest common divi...
The notion of extending Parikh q-matrix with respect to a word instead of an ordered alphabet is int...
Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates so...
AbstractWe introduce the notion of Parikh matrix induced by a word, a natural extension to the notio...
Abstract We introduce an extension of the Parikh mapping called the Parikh -matrix mapping, which ta...
In this paper we introduce a sharpening of the Parikh mapping and investigate its basic properties...
A set T ⊆ L is a Parikh test set of L if c(T) is a test set of c(L). We give a characterization of P...