Connectionist learning of regular graph grammars
(2001)
Journal Article
Fletcher. (2001). Connectionist learning of regular graph grammars. Connection science, 127 - 188. https://doi.org/10.1080/09540090110072327
This paper presents a new connectionist approach to grammatical inference. Using only positive examples, the algorithm learns regular graph grammars, representing two-dimensional iterative structures drawn on a discrete Cartesian grid. This work is i... Read More about Connectionist learning of regular graph grammars.