Leftmove-bounded picture languages
โ
Changwook Kim; Ivan Hal Sudborough
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 134 KB
Let = {u; d; r; l} be the chain-code picture alphabet such that u (d; r; l) denotes the graphics command to move the drawing pen up (down, right, left) in the 2D Cartesian plane. It is known that the picture membership problem can be solved in polynomial time for each context-free language over {u;