首页 | 本学科首页   官方微博 | 高级检索  
     


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.
Keywords:Formal languages   Chain code   Picture languages   Decision properties
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号