Retreat bounded picture languages
From MaRDI portal
Publication:1334657
DOI10.1016/0304-3975(94)90228-3zbMath0938.68708OpenAlexW2008613794MaRDI QIDQ1334657
Publication date: 25 September 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90228-3
Related Items (5)
On regular drawn symbolic picture languages ⋮ Unambiguous description of chain code picture languages ⋮ Adding symbolic information to picture models: definitions and properties ⋮ Two undecidability results for chain code picture languages ⋮ Leftmove-bounded picture languages
Cites Work
- Decision problems and regular chain code picture languages
- On the connectedness of pictures in chain code picture languages
- Complexity and decidability for restricted classes of picture languages
- Picture iteration and picture ambiguity
- Complexity and decidability for chain code picture languages
- The membership and equivalence problems for picture languages
- A transformation system for generating description languages of chain code pictures
- On reversal-bounded picture languages
- Using string languages to describe picture languages
- Languages of encoded line patterns
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Retreat bounded picture languages