Thin and slender languages
✍ Scribed by Gheorghe Pǎun; Arto Salomaa
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 832 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We give a complete proof of Theorem 3.1 in [2]. A pathological exception of Theorem 4.3 in [2] is exhibited and a condition to remove it is mentioned.
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 res
In this paper we propose a Chomsky-Schützenberger type characterization ofpoly-slender context-free languages, as the homomorphical image of an intersection of a Dyck language and a ´¾ • ½ µ -poly-slender regular language. A stronger result is provided, namely the homomorphism and the Dyck language