Infinite arrays and controlled deterministic table 0L array systems

DOI10.1016/0304-3975(84)90100-2zbMath0546.68035OpenAlexW2067185869MaRDI QIDQ797993

V. Rajkumar Dare, Rani Siromoney, K. G. Subramanian

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90100-2

zbMATH Keywords

adherence equivalence problemarray languageDeterministic table 0L array systems with controlgeneration of infinite arrayslimit language equivalence problem

Mathematics Subject Classification ID

Artificial intelligence (68T99) Grammars and rewriting systems (68Q42)

Related Items (3)

Parallel generation of infinite images ⋮ Picture deformation ⋮ Picture codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Avoidable patterns in strings of symbols
• On infinite words obtained by iterating morphisms
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• Pictures of functions and their acceptability by automata
• Infinite arrays and infinite computations
• Extended controlled table L-arrays
• Picture languages with array rewriting rules

This page was built for publication: Infinite arrays and controlled deterministic table 0L array systems