Machine characterization of eol-regular matrix systems

DOI10.1080/00207168708803569zbMath0656.68088OpenAlexW2054949534WikidataQ126245733 ScholiaQ126245733MaRDI QIDQ3804223

No author found.

Publication date: 1987

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168708803569

zbMATH Keywords

regular setscounters-finite matrix automataE0L-regular matrix systemsrestricted pushdown array

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Machine characterization of (E0L-E0L) array languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• EOL and ETOL array languages
• Table matrix L systems
• On a family of acceptors for some classes of developmental languages
• Extended controlled table L-arrays
• A formal picture description scheme as a basis for picture processing systems
• Picture languages with array rewriting rules

This page was built for publication: Machine characterization of eol-regular matrix systems