On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2014.10.005 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051092114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generating sequences of regular languages on <i>k</i> symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4147596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of the counting function of sparse context-free languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parikh counting functions of sparse context-free languages are quasi-polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-polynomials, linear Diophantine equations and semi-linear sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational sets in commutative monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic models and ambiguity of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision method for Parikh slenderness of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems concerning thinness and slenderness of formal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Parikh slender context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of poly-slender context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3345795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4116077 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2014.10.005 / rank
 
Normal rank

Latest revision as of 19:41, 9 December 2024

scientific article
Language Label Description Also known as
English
On the commutative equivalence of bounded context-free and regular languages: the code case
scientific article

    Statements

    On the commutative equivalence of bounded context-free and regular languages: the code case (English)
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    bounded context-free language
    0 references
    semilinear set
    0 references
    commutative equivalence
    0 references

    Identifiers