Merve Unuvar, Yurdaer Doganata, et al.
CLOUD 2014
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.
Merve Unuvar, Yurdaer Doganata, et al.
CLOUD 2014
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Hannah Kim, Celia Cintas, et al.
IJCAI 2023
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence