The notion of the Parikh mapping is generalized by considering numbers of occurrences of segments of a fixed length instead of considering numbers of letters (i.e., segments of length one) only as is done in connection with the Parikh mappings. It is easily seen that the families of regular and context-free languages make difference with respect to these generalized Parikh mappings. On the other hand, properties of the Parikh mappings in connection with λ-free homomorphisms are, in general, preserved in the generalization
AbstractIn this paper we propose a Chomsky-Schützenberger type characterization of k-poly-slender co...
AbstractThe operation of nested iterated substitution preserves languages with the semilinear proper...
Let L be a sparse context-free language over an alphabet of t letters and let f(L) : N(t) -> N be it...
Parikh matrices have become a useful tool for investigation of subword structure of words. Several g...
Abstract: An n-dimensional vector of natural numbers is said to be prime if the greatest common divi...
Abstract: We introduce a couple of families of codiable languages and investigate properties of thes...
This is the first paper of a group of three where we prove the following result. Let A be an alphabe...
AbstractIn this paper the operations of homomorphic equality and inverse homomorphic equality are in...
AbstractWe define and study Parikh slender languages and power series. A language is Parikh slender ...
AbstractEvery regular language R (over any alphabet) can be represented in the form R = h4h−13h2h−11...
AbstractIn this paper we first compare Parikh's condition to various pumping conditions — Bar-Hillel...
We show that for every context free language L over some alphabet \gE there effectively exists a tes...
This paper considers equality languages and fixed-point languages of homomorphisms and deterministic...
The family of vector languages properly contains all context-free languages. For vector languages th...
It is proved that every bounded context-free language L is commutatively equivalent to a regular lan...
AbstractIn this paper we propose a Chomsky-Schützenberger type characterization of k-poly-slender co...
AbstractThe operation of nested iterated substitution preserves languages with the semilinear proper...
Let L be a sparse context-free language over an alphabet of t letters and let f(L) : N(t) -> N be it...
Parikh matrices have become a useful tool for investigation of subword structure of words. Several g...
Abstract: An n-dimensional vector of natural numbers is said to be prime if the greatest common divi...
Abstract: We introduce a couple of families of codiable languages and investigate properties of thes...
This is the first paper of a group of three where we prove the following result. Let A be an alphabe...
AbstractIn this paper the operations of homomorphic equality and inverse homomorphic equality are in...
AbstractWe define and study Parikh slender languages and power series. A language is Parikh slender ...
AbstractEvery regular language R (over any alphabet) can be represented in the form R = h4h−13h2h−11...
AbstractIn this paper we first compare Parikh's condition to various pumping conditions — Bar-Hillel...
We show that for every context free language L over some alphabet \gE there effectively exists a tes...
This paper considers equality languages and fixed-point languages of homomorphisms and deterministic...
The family of vector languages properly contains all context-free languages. For vector languages th...
It is proved that every bounded context-free language L is commutatively equivalent to a regular lan...
AbstractIn this paper we propose a Chomsky-Schützenberger type characterization of k-poly-slender co...
AbstractThe operation of nested iterated substitution preserves languages with the semilinear proper...
Let L be a sparse context-free language over an alphabet of t letters and let f(L) : N(t) -> N be it...