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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
