Author:
Etessami Kousha,Yannakakis Mihalis
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Lecture Notes in Computer Science;R. Alur,2001
2. Abney, S., McAllester, D., Pereira, F.: Relating probabilistic grammars and automata. In: Proc. 37th Ann. Ass. for Comp. Linguistics, pp. 542–549 (1999)
3. Lecture Notes in Computer Science;A. Bouajjani,1997
4. Lecture Notes in Computer Science;M. Benedikt,2001
5. Basu, S., Pollack, R., Roy, M.F.: On the combinatorial and algebraic complexity of quantifier elimination. J. of the ACM 43(6), 1002–1045 (1996)
Cited by
42 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献