Abstract
Deterministic table 0L array systems with control are considered for the generation of infinite arrays. Rewriting of a rectangular array is done in parallel by a table of rules, the rightmost edge horizontally or the lowermost edge vertically downwards. The application of the tables is controlled by a control set. Cube-free and square-free infinite arrays are obtained as an application of this model. The adherence of the array language of a controlled deterministic table 0L array system is related to the adherence of its control set. The limit language equivalence problem and the adherence equivalence problem are shown to be undecidable for this system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.