Abstract
A uniquely parsable array grammar (UPAG) introduced by Yamamoto and Morita is a subclass of isometric array grammar (IAG) in which parsing can be performed without backtracking. Hence, we can use a UPAG as an efficient two-dimensional pattern recognition mechanism, if the pattern set is properly described by a UPAG. Furthermore, since a UPAG admits parallel parsing, it can also be used as a formal framework for parallel pattern recognition. In this paper, we show UPAG is also useful to generate and recognize three-dimensional patterns. We construct a UPAG that generate any size of cubes. This UPAG can recognize cubes in linear time of the length of its side by maximum parallel reduction. To construct the grammar, we have made a tool for designing three-dimensional IAG.
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.
