DOIAbstract
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 Parikh test sets for arbitrary language in terms of its Parikh basis, and the coincidence graph of letters
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 Parikh test sets for arbitrary language in terms of its Parikh basis, and the coincidence graph of letters
AbstractThe problem of homomorphism equivalence is to decide for some language L over some finite al...
AbstractThe operation of nested iterated substitution preserves languages with the semilinear proper...
We show that the validity of Parikh's theorem for context-free languages depends only on a few equa...
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...
We prove that for each positive integer n, the finite commutative language En = c(a1a2...an) possess...
AbstractA test set for a language L is a finite subset T of L with the property that each pair of mo...
AbstractWe prove that the complement of a commutative languageLis context-free if the Parikh-map ofL...
This is the first paper of a group of three where we prove the following result. Let A be an alphabe...
The notion of the Parikh mapping is generalized by considering numbers of occurrences of segments of...
AbstractLet l be a family of languages effectively closed under inverse homomorphism and intersectio...
Abstract: We introduce a couple of families of codiable languages and investigate properties of thes...
We show that for every context free language L over some alphabet \gE there effectively exists a tes...
AbstractWe define and study Parikh slender languages and power series. A language is Parikh slender ...
It is proved that every bounded context-free language L is commutatively equivalent to a regular lan...
AbstractA regular language L over an alphabet A is called piecewise testable if it is a finite Boole...
AbstractThe problem of homomorphism equivalence is to decide for some language L over some finite al...
AbstractThe operation of nested iterated substitution preserves languages with the semilinear proper...
We show that the validity of Parikh's theorem for context-free languages depends only on a few equa...
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...
We prove that for each positive integer n, the finite commutative language En = c(a1a2...an) possess...
AbstractA test set for a language L is a finite subset T of L with the property that each pair of mo...
AbstractWe prove that the complement of a commutative languageLis context-free if the Parikh-map ofL...
This is the first paper of a group of three where we prove the following result. Let A be an alphabe...
The notion of the Parikh mapping is generalized by considering numbers of occurrences of segments of...
AbstractLet l be a family of languages effectively closed under inverse homomorphism and intersectio...
Abstract: We introduce a couple of families of codiable languages and investigate properties of thes...
We show that for every context free language L over some alphabet \gE there effectively exists a tes...
AbstractWe define and study Parikh slender languages and power series. A language is Parikh slender ...
It is proved that every bounded context-free language L is commutatively equivalent to a regular lan...
AbstractA regular language L over an alphabet A is called piecewise testable if it is a finite Boole...
AbstractThe problem of homomorphism equivalence is to decide for some language L over some finite al...
AbstractThe operation of nested iterated substitution preserves languages with the semilinear proper...
We show that the validity of Parikh's theorem for context-free languages depends only on a few equa...
Add to ORKG