Leftmove-bounded picture languages
From MaRDI portal
Publication:1566721
DOI10.1016/S0304-3975(98)00164-9zbMath0939.68163MaRDI QIDQ1566721
Changwook Kim, Ivan Hal Sudborough
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (2)
On regular drawn symbolic picture languages ⋮ Two undecidability results for chain code picture languages
Cites Work
- Decision problems and regular 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
- Picture words with invisible lines
- Retreat bounded picture languages
- Unambiguous description of chain code picture languages
- STRICT LOCAL TESTABILITY OF THE FINITE CONTROL OF TWO-WAY AUTOMATA AND OF REGULAR PICTURE DESCRIPTION LANGUAGES
- Using string languages to describe picture languages
- Chain-code pictures and collages generated by hyperedge replacement
- Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Leftmove-bounded picture languages
