Author:
Han Yo-Sub,Ko Sang-Ki,Salomaa Kai
Funder
Natural Sciences and Engineering Research Council of Canada
National Research Foundation of Korea
Institute for Information and Communications Technology Promotion
Subject
General Computer Science,Theoretical Computer Science
Reference34 articles.
1. Visibly pushdown languages;Alur,2004
2. Adding nesting structure to words;Alur;J. ACM,2009
3. The tractability frontier for NFA minimization;Björklund;J. Comput. Syst. Sci.,2012
4. Visibly pushdown automata with multiplicities: finiteness and k-boundedness;Caralp,2012
5. 2-visibly pushdown automata;Carotenuto,2007
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献