1. Lecture Notes in Computer Science;PA Abdulla,1998
2. Lecture Notes in Computer Science;S Bardin,2006
3. Blondin, M., Finkel, A., Göller, S., Haase, C., McKenzie, P.: Reachability in two-dimensional vector addition systems with states is PSPACE-complete. In: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, 6–10 July 2015, pp. 32–43. IEEE Computer Society (2015)
4. Lecture Notes in Computer Science;S Böhm,2010
5. Böhm, S., Göller, S., Jancar, P.: Equivalence of deterministic one-counter automata is NL-complete. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) Symposium on Theory of Computing Conference, STOC 2013, Palo Alto, CA, USA, 1–4 June 2013, pp. 131–140. ACM (2013)