On regular drawn symbolic picture languages
From MaRDI portal
Publication:1877551
DOI10.1016/S0890-5401(03)00136-6zbMath1076.68107MaRDI QIDQ1877551
Vincenzo Deufemia, Carmine Gravino, Gennaro Costagliola, Filomena Ferrucci
Publication date: 19 August 2004
Published in: Information and Computation (Search for Journal in Brave)
Computing methodologies for image processing (68U10) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)
Related Items (1)
Cites Work
- 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
- Unambiguous description of chain code picture languages
- Leftmove-bounded picture languages
- Undecidability of existential properties in picture languages
- Plex languages
- Using string languages to describe picture languages
- Efficient reductions of picture words
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On regular drawn symbolic picture languages