scientific article; zbMATH DE number 871244

MaRDI QIDQ4874658zbMATH OpenFDO

Authors Frank Drewes, Hans-Jörg Kreowski

Publication date 13 August 1996

zbMATH Keywords

context-free syntactic devicespicture languages

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Selected Decision Problems for Square-Refinement Collage Grammars
• Chain-code pictures and collages generated by hyperedge replacement
• scientific article; zbMATH DE number 177447
• Criteria to disprove context-freeness of collage languages

Cited in

(9)

• Three-dimensional connected pictures are not recognizable by finite-state acceptors
• Criteria to disprove context freeness of collage languages.
• Two-dimensional connected pictures are not recognizable by finite-state acceptors
• Language theoretic and algorithmic properties of d-dimensional collages and patterns in a grid
• Undecidability of the emptiness problem for context-free picture languages
• Selected Decision Problems for Square-Refinement Collage Grammars
• scientific article; zbMATH DE number 177447 (Why is no real title available?)
• Chain-code pictures and collages generated by hyperedge replacement
• Criteria to disprove context-freeness of collage languages

This page was built for publication:

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