Decision problems and regular chain code picture languages
From MaRDI portal
Publication:686522
DOI10.1016/0166-218X(93)90138-EzbMath0797.68096OpenAlexW1969097186WikidataQ128110999 ScholiaQ128110999MaRDI QIDQ686522
Friedhelm Hinz, Juergen 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
Formal languages and automata (68Q45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (13)
Retreat bounded picture languages ⋮ Unambiguous description of chain code picture languages ⋮ Language generating alphabetic flat splicing P systems ⋮ Decision problems for edge grammars ⋮ Generating self-affine fractals by collage grammars ⋮ Chain-code pictures and collages generated by hyperedge replacement ⋮ Adding symbolic information to picture models: definitions and properties ⋮ Tree-based generation of languages of fractals ⋮ Two undecidability results for chain code picture languages ⋮ Perfectly quilted rectangular snake tilings ⋮ Leftmove-bounded picture languages ⋮ LINKS ⋮ Undecidability of existential properties in picture languages
Cites Work
- An undecidable problem about rational sets and contour words of polyominoes
- On the connectedness of pictures in chain code picture languages
- Complexity and decidability for restricted classes of picture languages
- Picture iteration and picture ambiguity
- Complexity and decidability for chain code picture languages
- The membership and equivalence problems for picture languages
- Using string languages to describe picture languages
- Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Decision problems and regular chain code picture languages
