Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats

DOI10.1007/BFb0028979zbMath1492.68079MaRDI QIDQ5096149

Friedhelm Hinz

Publication date: 16 August 2022

Published in: STACS 89 (Search for Journal in Brave)

zbMATH Keywords

normal formregular languageclosure propertychain codeformal language theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Unambiguous description of chain code picture languages ⋮ Decision problems and regular chain code picture languages ⋮ On reversal-bounded picture languages ⋮ Picture words with invisible lines ⋮ Group presentations, formal languages and characterizations of one- counter groups ⋮ Two undecidability results for chain code picture languages ⋮ Leftmove-bounded picture languages

Cites Work

• Using string languages to describe picture languages
• A formal picture description scheme as a basis for picture processing systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats