Decision problems and regular chain code picture languages
From MaRDI portal
Publication:686522
DOI10.1016/0166-218X(93)90138-EzbMATH Open0797.68096OpenAlexW1969097186WikidataQ128110999 ScholiaQ128110999MaRDI QIDQ686522FDOQ686522
Authors: Friedhelm Hinz, Jürgen Dassow 
Publication date: 2 December 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)90138-e
Recommendations
Formal languages and automata (68Q45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity and decidability for chain code picture languages
- The membership and equivalence problems for picture languages
- Using string languages to describe picture languages
- Complexity and decidability for restricted classes of picture languages
- Picture iteration and picture ambiguity
- Title not available (Why is that?)
- Title not available (Why is that?)
- An undecidable problem about rational sets and contour words of polyominoes
- Title not available (Why is that?)
- Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats
- On the connectedness of pictures in chain code picture languages
Cited In (23)
- Decision problems for edge grammars
- Title not available (Why is that?)
- Adding symbolic information to picture models: definitions and properties
- Two undecidability results for chain code picture languages
- Picture iteration and picture ambiguity
- Title not available (Why is that?)
- Complexity and decidability for chain code picture languages
- The membership and equivalence problems for picture languages
- Title not available (Why is that?)
- Retreat bounded picture languages
- Tree-based generation of languages of fractals
- Perfectly quilted rectangular snake tilings
- Decidability of the consistency problem for regular symbolic picture description languages
- Chain-code pictures and collages generated by hyperedge replacement
- Undecidability of existential properties in picture languages
- Links
- Unambiguous description of chain code picture languages
- Title not available (Why is that?)
- Leftmove-bounded picture languages
- Title not available (Why is that?)
- Language generating alphabetic flat splicing P systems
- Title not available (Why is that?)
- Generating self-affine fractals by collage grammars
This page was built for publication: Decision problems and regular chain code picture languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686522)
