@article{DALESSANDRO2015304,
    Abstract = {This is the first paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ:A⁎⟶Nt be the corresponding Parikh morphism. Given two languages L1,L2⊆A⁎, we say that L1 is commutatively equivalent to L2 if there exists a bijection f:L1⟶L2 from L1 onto L2 such that, for every u∈L1, ψ(u)=ψ(f(u)). Then every bounded context-free language is commutatively equivalent to a regular language.},
    Author = {D'Alessandro, Flavio and Intrigila, Benedetto},
    File = {On the commutative equivalence of bounded context-free and regular languages - The code case - 1-s2.0-S0304397514007671-main - a.pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Keywords = {Bounded context-free language, Semilinear set, Commutative equivalence},
    Pages = {304-319},
    Title = {On the commutative equivalence of bounded context-free and regular languages: The code case},
    URL = {https://www.sciencedirect.com/science/article/pii/S0304397514007671},
    Volume = {562},
    Year = {2015},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397514007671},
    bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2014.10.005},
    date-added = {2023-01-08 20:54:25 +0100},
    date-modified = {2023-01-08 20:54:25 +0100},
    doi = {10.1016/j.tcs.2014.10.005}
}

@article{DALESSANDRO2015304, Abstract = {This is the first paper of a group of three where we prove the following result. Let A be an alphabet of t letters and let ψ:A⁎⟶Nt be the corresponding Parikh morphism. Given two languages L1,L2⊆A⁎, we say that L1 is commutatively equivalent to L2 if there exists a bijection f:L1⟶L2 from L1 onto L2 such that, for every u∈L1, ψ(u)=ψ(f(u)). Then every bounded context-free language is commutatively equivalent to a regular language.}, Author = {D'Alessandro, Flavio and Intrigila, Benedetto}, File = {On the commutative equivalence of bounded context-free and regular languages - The code case - 1-s2.0-S0304397514007671-main - a.pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Keywords = {Bounded context-free language, Semilinear set, Commutative equivalence}, Pages = {304-319}, Title = {On the commutative equivalence of bounded context-free and regular languages: The code case}, URL = {https://www.sciencedirect.com/science/article/pii/S0304397514007671}, Volume = {562}, Year = {2015}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397514007671}, bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2014.10.005}, date-added = {2023-01-08 20:54:25 +0100}, date-modified = {2023-01-08 20:54:25 +0100}, doi = {10.1016/j.tcs.2014.10.005} }