Measuring two-dimensional complexity: A conceptual structure

摘要

Two-dimensional complexity is viewed as being analyzable through two-dimensional syntax. This premise is based on the assumption that there is a natural two-dimensional language, which is used for visual data processing and pattern recognition. Based on these assumptions, three measures of syntactic complexity, developed for context-free grammars, are shown to have application to Dacey's two-dimensional languages for simple polygons.