Unambiguous description of chain code picture languages
From MaRDI portal
Publication:1350202
DOI10.1016/0020-0190(96)00014-2zbMath0875.68601OpenAlexW2121682987MaRDI QIDQ1350202
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(96)00014-2
Related Items (4)
On regular drawn symbolic picture languages ⋮ Two undecidability results for chain code picture languages ⋮ Leftmove-bounded picture languages ⋮ Decidability of the consistency problem for regular symbolic picture description languages
Cites Work
- Decision problems and regular chain code picture languages
- Picture iteration and picture ambiguity
- Complexity and decidability for chain code picture languages
- The membership and equivalence problems for picture languages
- A transformation system for generating description languages of chain code pictures
- On reversal-bounded picture languages
- Picture words with invisible lines
- Retreat bounded 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
This page was built for publication: Unambiguous description of chain code picture languages
