Bing Zhang, Mikio Takeuchi, et al.
NAACL 2025
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.
Bing Zhang, Mikio Takeuchi, et al.
NAACL 2025
Albert Atserias, Anuj Dawar, et al.
Journal of the ACM
Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
Barry K. Rosen
SWAT 1972