A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On Parikh slender languages and power series
Tekijät: Honkala J
Kustantaja: ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS
Julkaisuvuosi: 1996
Tietokannassa oleva lehden nimi: JOURNAL OF COMPUTER AND SYSTEM SCIENCES
Lehden akronyymi: J COMPUT SYST SCI
Vuosikerta: 52
Numero: 1
Aloitussivu: 185
Lopetussivu: 190
Sivujen määrä: 6
ISSN: 0022-0000
DOI: https://doi.org/10.1006/jcss.1996.0014
Tiivistelmä
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.
Turun yliopiston Tutkimustietojärjestelmän portaali