Non-recursive Trade-offs between Two-Dimensional Automata and Grammars

DOI10.1007/978-3-319-09704-6_31zbMath1332.68126OpenAlexW1560530681MaRDI QIDQ5496202

Daniel Průša

Publication date: 7 August 2014

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09704-6_31

zbMATH Keywords

picture languagesdescriptional complexityfour-way automatatwo-dimensional context-free grammars

Mathematics Subject Classification ID

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

Related Items (2)

(Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars ⋮ Undecidability of the emptiness problem for context-free picture languages

This page was built for publication: Non-recursive Trade-offs between Two-Dimensional Automata and Grammars