Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference40 articles.
1. Visibly pushdown languages;Alur,2004
2. Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1;Barrington;J. Comput. Syst. Sci.,1989
3. Finite monoids: from word to circuit evaluation;Beaudry;SIAM J. Comput.,1997
4. R. Beigel, L.A. Hemachandra, G. Wechsung, On the power of probabilistic polynomial time: PNP[log] subseteq PP, in: Proc. Structure in Complexity Theory Conference 1989, 1989, pp. 225–227.
5. Formal properties of XML grammars and languages;Berstel;Acta Inform.,2002
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献