Theoretical error assessment of curved line digitization schemes on graphic displays

✍ Scribed by Kazuo Kishimoto; Kenji Onaga; Kiyoshi Yamamoto

• Publisher: Elsevier Science
• Year: 1986
• Weight: 81 KB
• Volume: 34
• Category: Article
• ISSN: 0734-189X
• DOI: 10.1016/0734-189x(86)90067-8

✦ Synopsis

This paper investigates the basic properties of the class of neighborhood-uniform node label controlled (NUNLC) graph grammars. The class of NUNLC grammars is distinguished by requiring a very natural restriction on the connection relations of NLC grammars. The restriction implies the "Church-Rosser property" of derivations in an NUNLC grammar, which makes the class of NUNLC grammars " technically easier" to investigate. A number of combinatorial properties of the languages generated by the class of NUNLC grammars are proved. Also, it is demonstrated that a number of basic properties are decidable for the class of NUNLC grammar-many of them are undecidable in the whole class of NLC grammars.