Author:
Bruda Stefan D.,Wilkin Mary Sarah Ruth
Publisher
Springer International Publishing
Reference27 articles.
1. Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 04), Lecture Notes in Computer Science, vol. 2988, pp. 467–481. Springer (2004)
2. Bergstra, J.A., Klop, J.W.: Process theory based on bisimulation semantics. In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science, vol. 354, pp. 50–122. Springer (1988)
3. Bruda, S.D., Bin Waez, M.T.: Unrestricted and disjoint operations over multi-stack visibly pushdown languages. In: Proceedings of the 6th International Conference on Software and Data Technologies (ICSOFT 2011), vol. 2, pp. 156–161. Seville, Spain (2011)
4. Bruda, S.D., Wilkin, M.S.R.: Parse trees and unique queries in context-free parallel communicating grammar systems. Technical Report 2013-001, Department of Computer Science, Bishop’s University (2013)
5. Cai, L.: The computational complexity of linear PCGS. Comput. AI 15(2–3), 199–210 (1989)