Author:
Berglund Martin,Björklund Henrik,Björklund Johanna
Subject
General Computer Science,Theoretical Computer Science
Reference44 articles.
1. Visibly pushdown languages;Alur,2004
2. On the complexity of ID/LP parsing 1;Barton;Computational Linguistics,1985
3. M. Berglund, H. Björklund, J. Högberg, Recognizing shuffled languages, in: Proc. Language and Automata Theory and Applications, 2011, pp. 142–154.
4. The expressive power of the shuffle product;Berstel;Information and Computation,2010
5. F. Biegler, M. Daley, I. McQuillan, On the shuffle automaton size for words, in: Proc. Descriptional Complexity of Formal Systems, 2009, pp.79–89.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献