Jehanzeb Mirza, Leonid Karlinsky, et al.
NeurIPS 2023
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.
Jehanzeb Mirza, Leonid Karlinsky, et al.
NeurIPS 2023
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Zhikun Yuen, Paula Branco, et al.
DSAA 2023
Ryan Johnson, Ippokratis Pandis
CIDR 2013