Two undecidability results for chain code picture languages
It is undecidable whether or not two I-retreat-bounded regular languages describe exactly the same set of pictures or they describe a picture in common. (C) 2002 Elsevier Science B.V. All rights reserved.
chain code picture languages formal languages decision properties