Visibly Pushdown Automata: Universality and Inclusion via Antichains-Reference-Cited by-同舟云学术

Visibly Pushdown Automata: Universality and Inclusion via Antichains

Published:2013 Issue: Volume: Page:190-201
ISSN:0302-9743
Container-title:Language and Automata Theory and Applications
language:
Short-container-title:

Author:

Bruyère Véronique,Ducobu Marc,Gauwin Olivier

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-37064-9_18

Reference18 articles.

1. Lecture Notes in Computer Science;P.A. Abdulla,2010

2. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: 36th ACM Symposium on Theory of Computing, pp. 202–211. ACM-Press (2004)

3. Alur, R., Madhusudan, P.: Adding nesting structure to words. Journal of the ACM 56(3), 1–43 (2009)

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

5. Brüggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets: Version 1. Tech. Rep. HKTUST-TCSC-2001-05, HKUST Theoretical Computer Science Center Research (2001)

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

1. On the Decidability of Infix Inclusion Problem;Theory of Computing Systems;2024-01-13

2. Antichains Algorithms for the Inclusion Problem Between $$\omega $$-VPL;Tools and Algorithms for the Construction and Analysis of Systems;2023

3. On the Decidability of Infix Inclusion Problem;Developments in Language Theory;2022

4. Ramsey-Based Inclusion Checking for Visibly Pushdown Automata;ACM Transactions on Computational Logic;2015-11-19

5. Antichains for the Verification of Recursive Programs;Networked Systems;2015