Shortest Paths in One-Counter Systems-Reference-Cited by-同舟云学术

Shortest Paths in One-Counter Systems

Published:2016 Issue: Volume: Page:462-478
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Chistikov Dmitry,Czerwiński Wojciech,Hofman Piotr,Pilipczuk Michał,Wehar Michael

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-49630-5_27

Reference17 articles.

1. Alur, R., Černý, P.: Streaming transducers for algorithmic verification of single-pass list-processing programs. In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, 26–28 January 2011, pp. 599–610 (2011)

2. Atig, M.F., Bouajjani, A., Kumar, K.N., Saivasan, P.: On bounded reachability analysis of shared memory systems. In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, 15–17 December 2014, New Delhi, India, pp. 611–623 (2014)

3. Lecture Notes in Computer Science;C Barrett,2013

4. Lecture Notes in Computer Science;A Bouajjani,1997

5. Chistikov, D.: Notes on counting with finite machines. In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, 15–17 December 2014, New Delhi, India, pp. 339–350 (2014)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Shortest Accepted Strings for Two-Way Finite Automata: Approaching the $$2^n$$ Lower Bound;Descriptional Complexity of Formal Systems;2023

2. On the Length of Shortest Strings Accepted by Two-way Finite Automata;Fundamenta Informaticae;2021-06-30

3. Longer Shortest Strings in Two-Way Finite Automata;Descriptional Complexity of Formal Systems;2020

4. SHORTEST PATHS IN ONE-COUNTER SYSTEMS;LOG METH COMPUT SCI;2019

5. THE COMPLEXITY OF FLAT FREEZE LTL;LOG METH COMPUT SCI;2019