On the Connectedness of Pictures in Chain Code Picture Languages
暂无分享，去创建一个
Abstract For linear grammars it is undecidable whether or not some (all) pictures in the generated chain code picture language are connected.
[1] Ivan Hal Sudborough,et al. Complexity and Decidability for Chain Code Picture Languages , 1985, Theor. Comput. Sci..
[2] Friedheld Hinz. Questions of Decidability for Context-free Chain Code Picture Languages , 1988, IMYCS.