On Parikh slender languages and power series



: Honkala J

Publisher: ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS

: 1996

: JOURNAL OF COMPUTER AND SYSTEM SCIENCES

: J COMPUT SYST SCI

: 52

: 1

: 185

: 190

: 6

: 0022-0000

DOI: https://doi.org/10.1006/jcss.1996.0014


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. (C) 1996 Academic Press, Inc.



Last updated on 2024-26-11 at 14:37