scientific article; zbMATH DE number 871244

zbMATH Open0843.68118MaRDI QIDQ4874658FDOQ4874658

Authors: Frank Drewes, Hans-Jörg Kreowski 

Publication date: 13 August 1996

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

picture languagescontext-free syntactic devices

Mathematics Subject Classification ID

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

Cited In (8)

• Criteria to disprove context freeness of collage languages.
• Undecidability of the emptiness problem for context-free picture languages
• Selected Decision Problems for Square-Refinement Collage Grammars
• Chain-code pictures and collages generated by hyperedge replacement
• Two-dimensional connected pictures are not recognizable by finite-state acceptors
• Criteria to disprove context-freeness of collage languages
• Three-dimensional connected pictures are not recognizable by finite-state acceptors
• Title not available (Why is that?)

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)