Efficient reductions of picture words

DOI10.1051/ita/1993270100491zbMath0770.68081OpenAlexW8065238MaRDI QIDQ5286054

Franz-Josef Brandenburg, Juergen Dassow

Publication date: 29 June 1993

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92437

zbMATH Keywords

grid graphEuler tourreduction rules

Mathematics Subject Classification ID

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

Related Items (4)

Cancellation in context-free languages: enrichment by reduction ⋮ On regular drawn symbolic picture languages ⋮ Picture words with invisible lines ⋮ Adding symbolic information to picture models: definitions and properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity and decidability for chain code picture languages
• A transformation system for generating description languages of chain code pictures
• Using string languages to describe picture languages
• Storage Modification Machines
• Matching, Euler tours and the Chinese postman

This page was built for publication: Efficient reductions of picture words