Two undecidability results for chain code picture languages

Authors:
Changwook Kim
Affiliations:
Univ. of Oklahoma, Norman
Venue:
Theoretical Computer Science
Year:
2002

Citing 16
Cited 0

Complexity and decidability for chain code picture languages

Theoretical Computer Science
The membership and equivalence problems for picture languages

Theoretical Computer Science
Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats

Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
A transformation system for generating description languages of chain code pictures

Theoretical Computer Science
Picture iteration and picture ambiguity

Journal of Computer and System Sciences
Complexity and decidability for restricted classes of picture languages

Theoretical Computer Science
On reversal-bounded picture languages

Theoretical Computer Science
Picture words with invisible lines

Theoretical Computer Science
Decision problems and regular chain code picture languages

Discrete Applied Mathematics
Retreat bounded picture languages

Theoretical Computer Science
Picture languages—a survey

Languages of Design
Unambiguous description of chain code picture languages

Information Processing Letters
Undecidability of existential properties in picture languages

Theoretical Computer Science
Computer Processing of Line-Drawing Images

ACM Computing Surveys (CSUR)
Leftmove-bound picture languages

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

It is undecidable whether or not two 1-retreat-bounded regular languages describe exactly the same set of pictures or they describe a picture in common.