Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
