Generation of Simply-Connected Patterns and Simple Closed Curves by Uniquely Parsable Array Grammars

スポンサーリンク

概要

• 論文の詳細を見る

• A uniquely parsable array grammar (UPAG) is a special kind of isometric array grammar in which parsing can be performed without backtracking. In this paper, we investigate the problem of describing and recognizing the sets of simply-connected patterns and simple closed curves using a UPAG formalism.

• 社団法人電子情報通信学会の論文
• 2002-02-01

著者

• Morita Kenichi

  Faculty Of Engineering Hiroshima University

• Qi Jin-shan

  Faculty Of Engineering Hiroshima University

• Shauri Ruhizan

  Faculty Of Engineering Hiroshima University

関連論文

• Generation of Simply-Connected Patterns and Simple Closed Curves by Uniquely Parsable Array Grammars

スポンサーリンク