Arthur Nádas
IEEE Transactions on Neural Networks
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.
Arthur Nádas
IEEE Transactions on Neural Networks
Miao Guo, Yong Tao Pei, et al.
WCITS 2011
R. Sebastian, M. Weise, et al.
ECPPM 2022
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence