The problem of the commutative equivalence of context-free and regular languages is studied. In particular conditions ensuring that a context-free language of exponential growth is commutatively equivalent with a regular language are investigated
AbstractIt is undecidable whether or not a given context-free language and a propagating DT0L langua...
We consider commutative regular and context-free grammars, or, in otherwords, Parikh images of regul...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
The problem of the commutative equivalence of context-free and regular languages is studied. Conditi...
The problem of the commutative equivalence of semigroups generated by semi-linear languages is studi...
It is proved that every bounded context-free language L is commutatively equivalent to a regular lan...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
Given two finite-state automata, are the Parikh images of the languages they generate equivalent? Th...
This is the first paper of a group of three where we prove the following result. Let A be an alphabe...
In this paper we investigate the computational complexity of the inequivalence problems for commutat...
Pattern languages are generalisations of the copy language, which is a standard textbook example of ...
We consider the complexity of the equivalence and containment problems for regular expressions and c...
Given two finite-state automata, are the Parikh images of the languages they generate equiva-lent? T...
AbstractWe show that there is a regular language which cannot be generated by context-free evolution...
AbstractA new characterization of commutative regular languages is given. Using it, it is proved tha...
AbstractIt is undecidable whether or not a given context-free language and a propagating DT0L langua...
We consider commutative regular and context-free grammars, or, in otherwords, Parikh images of regul...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
The problem of the commutative equivalence of context-free and regular languages is studied. Conditi...
The problem of the commutative equivalence of semigroups generated by semi-linear languages is studi...
It is proved that every bounded context-free language L is commutatively equivalent to a regular lan...
AbstractThis paper considers conditions under which a context-free language is regular and condition...
Given two finite-state automata, are the Parikh images of the languages they generate equivalent? Th...
This is the first paper of a group of three where we prove the following result. Let A be an alphabe...
In this paper we investigate the computational complexity of the inequivalence problems for commutat...
Pattern languages are generalisations of the copy language, which is a standard textbook example of ...
We consider the complexity of the equivalence and containment problems for regular expressions and c...
Given two finite-state automata, are the Parikh images of the languages they generate equiva-lent? T...
AbstractWe show that there is a regular language which cannot be generated by context-free evolution...
AbstractA new characterization of commutative regular languages is given. Using it, it is proved tha...
AbstractIt is undecidable whether or not a given context-free language and a propagating DT0L langua...
We consider commutative regular and context-free grammars, or, in otherwords, Parikh images of regul...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
DOI
Add to ORKG