Context-Sensitive String Languages and Recognizable Picture Languages
| Autor: | Latteux, M., Simplot, D. |
|---|---|
| Zdroj: | Information and Computation; November 1997, Vol. 138 Issue: 2 p160-169, 10p |
| Abstrakt: | The theorem stating that the family of frontiers of recognizable tree languages is exactly the family of context-free languages (see J. Mezei and J. B. Wright, 1967,Inform. and Comput.11, 3–29), is a basic result in the theory of formal languages. In this article, we prove a similar result: the family of frontiers of recognizable picture languages is exactly the family of context-sensitive languages |
| Databáze: | Supplemental Index |
| Externí odkaz: |
|
Full Text from ScienceDirect