Abstract
Shape schema grammars generalize parametric shape grammars so that both rules and the objects to which they apply are expressed with shape schemata. This paper defines shape schema grammars. It starts with a notation for schemata in general and shape schemata in particular. Schema equality is shown to have at least three possible definitions, of which schema consistency is the most useful. A limited notion of shape schema maximality potentially reduces the size and redundancy of a given schema. Shape schema subpart is a multifunction returning all of the possible ways that one shape schema can be embedded in another. Shape schema difference and addition complete the basic mathematical operations over shape schemata required to define shape schema rules, grammars and languages.
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.
