Two undecidability results for chain code picture languages
Authors:
Changwook Kim
Affiliation:
School of Computer Science, University of Oklahoma, 200 Felgar Street, Norman, OK 73019, USA
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.