A1 Refereed original research article in a scientific journal
On Parikh slender languages and power series
Authors: Honkala J
Publisher: ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS
Publication year: 1996
Journal name in source: JOURNAL OF COMPUTER AND SYSTEM SCIENCES
Journal acronym: J COMPUT SYST SCI
Volume: 52
Issue: 1
First page : 185
Last page: 190
Number of pages: 6
ISSN: 0022-0000
DOI: https://doi.org/10.1006/jcss.1996.0014
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. (C) 1996 Academic Press, Inc.
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.
UTU Research Portal