@article{HONKALA1996185,
Abstract = {We define and study Parikh slender languages and power series. A language is Parikh slender if the number of words in the language with the same Parikh vector is bounded from above. As an application we get a new method for ambiguity proofs of context-free languages and a new proof of an earlier result of Autebert, Flajolet, and Gabarro concerning prefixes of infinite words.},
Author = {Honkala, Juha},
File = {On Parikh Slender Languages and Power Series - 1-s2.0-S0022000096900148-main - a.pdf},
ISSN = {0022-0000},
Journal = {Journal of Computer and System Sciences},
Number = {1},
Pages = {185-190},
Title = {On Parikh Slender Languages and Power Series},
URL = {https://www.sciencedirect.com/science/article/pii/S0022000096900148},
Volume = {52},
Year = {1996},
bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0022000096900148},
bdsk-url-2 = {https://doi.org/10.1006/jcss.1996.0014},
date-added = {2023-01-07 09:19:46 +0100},
date-modified = {2023-01-07 09:19:46 +0100},
doi = {10.1006/jcss.1996.0014}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A