Infinite arrays and controlled deterministic table 0L array systems

DOI10.1016/0304-3975(84)90100-2zbMATH Open0546.68035OpenAlexW2067185869MaRDI QIDQ797993FDOQ797993

V. R. 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)

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Picture codes
• Picture deformation
• Parallel generation of infinite images

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Infinite Arrays and Domino Systems 👍 👎
• Quasi-deterministic 0L systems 👍 👎
• Deterministic Lindenmayer Systems with Dynamic Control of Parallelism 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797993)