@article{BertoniMassazzaSabadini:IJFCS:1992,
Abstract = {In this paper we give some undecidability and decidability results about context-free languages. First, we prove that the problem of deciding whether a context-free language which admits a holonomic generating function is Turing equivalent to the finiteness question for r.e. sets. Second, we show that the Equivalence Problem is decidable for a suitable class of languages, called LCLR.},
Author = {Bertoni, Alberto and Massazza, Paolo and Sabadini, Nicoletta},
EPrint = {https://doi.org/10.1142/S0129054192000127},
File = {Holonomic generating functions and context-free languages - bertoni1992 - a - q.pdf},
Journal = {International Journal of Foundations of Computer Science},
Number = {02},
Pages = {181--191},
Title = {Holonomic generating functions and context-free languages},
URL = {https://doi.org/10.1142/S0129054192000127},
Volume = {03},
Year = {1992},
bdsk-url-1 = {https://doi.org/10.1142/S0129054192000127},
date-added = {2020-05-10 10:09:57 +0200},
date-modified = {2020-10-02 18:56:09 +0200},
doi = {10.1142/S0129054192000127}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A