학술논문
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata
Document Type
Conference Paper
Author
Source
In: Leibniz International Proceedings in Informatics, LIPIcs , 34th International Conference on Concurrency Theory, CONCUR 2023. (Leibniz International Proceedings in Informatics, LIPIcs, September 2023, 279)
Subject
Language
English
ISSN
18688969