Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 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.
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
Paula Harder, Venkatesh Ramesh, et al.
EGU 2023
R. Sebastian, M. Weise, et al.
ECPPM 2022
Susan L. Spraragen
International Conference on Design and Emotion 2010