Two-dimensional context-free grid grammars

DOI10.1142/S012905412543004XMaRDI QIDQ6989490zbMATH OpenFDO

Authors Daniel Průša

Publication date 30 April 2025

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S012905412543004X

zbMATH Keywords

closure propertiesderivation treepicture languagerecognizable functionstwo-dimensional context-free grammar

Mathematics Subject Classification ID

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

Cites work

• A CKY parser for picture grammars
• A unifying approach to picture grammars
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• scientific article; zbMATH DE number 3738961 (Why is no real title available?)
• scientific article; zbMATH DE number 7770055 (Why is no real title available?)
• Matrix-based complexity functions and recognizable picture languages
• Non-recursive trade-offs between two-dimensional automata and grammars
• Picture languages with array rewriting rules
• Regional Languages and Tiling: A Unifying Approach to Picture Grammars
• Regular expressions and context-free grammars for picture languages
• Ten lectures on statistical and structural pattern recognition.
• Two-dimensional models
• Undecidability of the emptiness problem for context-free picture languages

This page was built for publication: Two-dimensional context-free grid grammars

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