Affiliation:
1. Department of Computing Science, Umeå University, S-90187 Umeå, Sweden
Abstract
We define the notion of links, thus generalizing the chain-code, turtle geometry, and collage formalisms. As links can be concatenated, link grammars can be defined in a similar way as chain-code grammars. Context-free link grammars are shown to be strictly more powerful than both context-free chain-code grammars and context-free collage grammars. Moreover, we study the generalization obtained by extending the formalism with the brackets known from the turtle geometry.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)