Picture words with invisible lines

DOI10.1016/0304-3975(93)90199-4zbMath0774.68074OpenAlexW2013312330MaRDI QIDQ1208724

Karine Slowinski

Publication date: 16 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90199-4

zbMATH Keywords

rewriting systempicture words

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Formal languages and automata (68Q45)

Related Items (3)

Unambiguous description of chain code picture languages ⋮ Two undecidability results for chain code picture languages ⋮ Leftmove-bounded picture languages

Cites Work

• A transformation system for generating description languages of chain code pictures
• 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
• Efficient reductions of picture words
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Picture words with invisible lines