Abstract
Two kinds of three-way isometric array grammars arc proposed as subclasses of an isometric monotonic array grammar. They are a three-way horizontally context-sensitive array grammar (3HCSAG) and a three-way immediately terminating array grammar (3ITAG). In these three-way grammars, patterns of symbols can grow only in the leftward, rightward and downward directions. We show that their generating abilities of rectangular languages are precisely characterized by some kinds of three-way two-dimensional Turing machines or related acceptors. In this paper. the following results are proved. First, 3HCSAG is characterized by a nondeterministic two-dimensional three-way Turing machine with space-bound n (n is the width of a rectangular input) and a nondeterministic one-way parallel/sequential array acceptor. Second, 3ITAG is characterized by a nondeterministic two-dimensional three-way real-time (or linear-time) restricted Turing machine, a nondeterministic one-dimensional bounded cellular acceptor and a nondeterministic two-dimensional one-line tessellation acceptor.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Pattern Recognition and Artificial Intelligence
Disclaimer: 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.