Criteria to disprove context freeness of collage languages
✍ Scribed by Frank Drewes; Hans-Jörg Kreowski; Denis Lapoire
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 262 KB
- Volume
- 290
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
Collage grammars are context-free devices which generate picture languages consisting of collages-sets of parts, where a part is a set of points in a given space. In order to show that certain collage languages cannot be generated, the well-known pumping technique turns out to be rather useless. To circumvent this di culty, other necessary criteria for context-freeness are established in this paper. Roughly speaking, these criteria reveal that (1) the collages in a context-free collage language can be de ated stepwise in such a manner that the di erence between subsequent collages in the resulting chain is small and (2) the volume of parts can grow or shrink only exponentially.
📜 SIMILAR VOLUMES
In this paper we first compare Parikh's condition to various pumping conditions ~ Bar-Hillel's pumping lemma, Ogden's condition and Bader-Moura's condition; secondly, to interchange condition; and finally, to Sokolowski's and Grant"s conditions. In order to carry out these comparisons we present som
## Abstract Public resource allocation often requires the management of conflicting objectives of multiple policy actors at different spatial levels. An example is the case study on which this paper is based: the definition of an investment policy in new inter‐municipal road‐links in the Lisbon Met