@article{CASTIGLIONE201774,
    Abstract = {We define a class of languages (RCM) obtained by considering Regular languages, linear Constraints on the number of occurrences of symbols and Morphisms. The class RCM presents some interesting closure properties, and contains languages with holonomic generating functions. As a matter of fact, RCM is related to one-way 1-reversal bounded k-counter machines and also to Parikh automata on letters. Indeed, RCM is contained in LNFCM but not in LDFCM, and strictly includes LLPA. We conjecture that LDFCM⊂RCM.},
    Author = {Castiglione, Giusi and Massazza, Paolo},
    File = {On a class of languages with holonomic generating functions 1 - a - j.pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Keywords = {Holonomic functions, Parikh vectors, Context free languages, -counter machines, Parikh automata},
    Note = {Formal Languages and Automata: Models, Methods and Application In honour of the 70th birthday of Antonio Restivo},
    Pages = {74 - 84},
    Title = {On a class of languages with holonomic generating functions},
    URL = {http://www.sciencedirect.com/science/article/pii/S0304397516303565},
    Volume = {658},
    Year = {2017},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0304397516303565},
    bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2016.07.022},
    date-added = {2019-05-28 11:19:52 +0200},
    date-modified = {2019-05-28 11:19:52 +0200},
    doi = {10.1016/j.tcs.2016.07.022}
}

@article{CASTIGLIONE201774, Abstract = {We define a class of languages (RCM) obtained by considering Regular languages, linear Constraints on the number of occurrences of symbols and Morphisms. The class RCM presents some interesting closure properties, and contains languages with holonomic generating functions. As a matter of fact, RCM is related to one-way 1-reversal bounded k-counter machines and also to Parikh automata on letters. Indeed, RCM is contained in LNFCM but not in LDFCM, and strictly includes LLPA. We conjecture that LDFCM⊂RCM.}, Author = {Castiglione, Giusi and Massazza, Paolo}, File = {On a class of languages with holonomic generating functions 1 - a - j.pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Keywords = {Holonomic functions, Parikh vectors, Context free languages, -counter machines, Parikh automata}, Note = {Formal Languages and Automata: Models, Methods and Application In honour of the 70th birthday of Antonio Restivo}, Pages = {74 - 84}, Title = {On a class of languages with holonomic generating functions}, URL = {http://www.sciencedirect.com/science/article/pii/S0304397516303565}, Volume = {658}, Year = {2017}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0304397516303565}, bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2016.07.022}, date-added = {2019-05-28 11:19:52 +0200}, date-modified = {2019-05-28 11:19:52 +0200}, doi = {10.1016/j.tcs.2016.07.022} }

Library Size: 13G (12942 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge