Machine characterization of (E0L-E0L) array languages

DOI10.1016/0304-3975(91)90330-5zbMath0738.68053OpenAlexW1980034136MaRDI QIDQ1177144

S. Singh

Publication date: 26 June 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90330-5

zbMATH Keywords

closure propertiescyclic permutationAFM operatorscolumn cross doublingcolumn homomorphismmachine characterization of (E0L-E0L) array languagespicture language operatorsrow cross doubling

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Context dependent table matrix L systems
• EOL and ETOL array languages
• Normal form of extended table matrix L systems
• Index on etol array languages
• Machine characterization of eol-regular matrix systems
• Table matrix L systems
• Description of developmental languages using recurrence systems
• On a family of acceptors for some classes of developmental languages

This page was built for publication: Machine characterization of (E0L-E0L) array languages