Decidability of the consistency problem for regular symbolic picture description languages

DOI10.1016/S0020-0190(01)00154-5zbMath1032.68092OpenAlexW2041713623MaRDI QIDQ1603368

Filomena Ferrucci, Gennaro Costagliola, Vincenzo Deufemia, Carmine Gravino

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00154-5

zbMATH Keywords

Picture languagesFormal languagesChain codeVisual languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Symbol -- relation grammars: A formalism for graphical languages
• Complexity and decidability for chain code picture languages
• The membership and equivalence problems for picture languages
• Unambiguous description of chain code picture languages
• Using string languages to describe picture languages

This page was built for publication: Decidability of the consistency problem for regular symbolic picture description languages