World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Spring Sale: Get 35% off with a min. purchase of 2 titles. Use code SPRING35. Valid till 31st Mar 2025.

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
No Access

SYSTOLIC PYRAMID AUTOMATA, CELLULAR AUTOMATA AND ARRAY LANGUAGES

    https://doi.org/10.1142/9789814368308_0008Cited by:0 (Source: Crossref)
    Previous
    Next
    Abstract:

    Systolic pyramid automata accepting square arrays are defined. Homogeneous and semihomogeneous pyramid automata are shown to have equal power though regular pyramid automata are more powerful. Languages accepted by these automata are compared with languages generated by array grammars and languages accepted by one-way 2-D cellular automata. Hexagonal pyramid automata are also considered and are shown to accept some languages generated by hexagonal may grammars.