Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
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.
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Ran Iwamoto, Kyoko Ohara
ICLC 2023
Seung Gu Kang, Jeff Weber, et al.
ACS Fall 2023
Rangachari Anand, Kishan Mehrotra, et al.
IEEE Transactions on Neural Networks