Adding symbolic information to picture models: definitions and properties

DOI10.1016/j.tcs.2005.03.028zbMath1077.68041OpenAlexW1971623785MaRDI QIDQ557811

Filomena Ferrucci, Gennaro Costagliola, Carmine Gravino

Publication date: 30 June 2005

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.028

zbMATH Keywords

Chain code picturesDecidability problemsPicture languagesString descriptions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25)

Related Items

The code problem for directed figures, Plane-Filling Properties of Directed Figures, DIRECTED FIGURE CODES: DECIDABILITY FRONTIER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decision problems and regular chain code picture languages
• Complexity and decidability for restricted classes of picture languages
• Picture iteration and picture ambiguity
• Easy multiplications. II: Extensions of rational semigroups
• Complexity and decidability for chain code picture languages
• The membership and equivalence problems for picture languages
• On reversal-bounded picture languages
• Composed figures of pixels and inverse monoid
• Retreat bounded picture languages
• Undecidability of existential properties in picture languages
• Using string languages to describe picture languages
• Efficient reductions of picture words