Author:
Hofman Piotr,Totzke Patrick
Publisher
Springer International Publishing
Reference17 articles.
1. Lecture Notes in Computer Science;P.A. Abdulla,1998
2. Böhm, S., Göller, S., Jančar, P.: Equivalence of Deterministic One-Counter Automata is NL-complete. In: STOC, pp. 131–140 (2013)
3. Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Logic 10(3), 16:1–16:30 (2009)
4. Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and Primitive-Recursive Bounds with Dickson’s Lemma. In: LICS, pp. 269–278 (2011)
5. Higuchi, K., Wakatsuki, M., Tomita, E.: Some Properties of Deterministic Restricted One-Counter Automata. In: IEICE E79-D.8, pp. 914–924 (July 1996)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献