Rangachari Anand, Kishan Mehrotra, et al.
IEEE Transactions on Neural Networks
Paper
Finding circular attributes in attribute grammars
Abstract
The problem of finding the circular attributes in an attribute grammar is considered. Two algorithms are proposed: the first is polynomial but yields conservative results while the second is exact but is potentially exponential. It is also shown that finding the circular attributes is harder than testing circularity. © 1999 ACM.
Related
Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Robert Farrell, Rajarshi Das, et al.
AAAI-SS 2010