On solving cycle-free context-free grammar equivalence problem using numerical analysis
暂无分享,去创建一个
[1] Arto Salomaa,et al. Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.
[2] Nelma Moreira,et al. Testing the Equivalence of Regular Languages , 2009, DCFS.
[3] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .
[4] Sumit Gulwani,et al. Towards Automating Grammar Equivalence Checking , 2015 .
[5] José João Almeida,et al. Context-Free Grammars: Exercise Generation and Probabilistic Assessment , 2016, SLATE.
[6] Patrick Cousot,et al. Grammar Analysis and Parsing by Abstract Interpretation , 2006, Program Analysis and Compilation.
[7] Hans Leiß,et al. To CNF or not to CNF? An Efficient Yet Presentable Version of the CYK Algorithm , 2009, Informatica Didact..
[8] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.
[9] Sumit Gulwani,et al. Automating grammar comparison , 2015, OOPSLA.
[10] B. Mityagin. The Zero Set of a Real Analytic Function , 2015, Mathematical Notes.
[11] M. Schützenberger. On a Theorem of R. Jungen , 1962 .
[12] Patrick Cousot,et al. Grammar semantics, analysis and parsing by abstract interpretation , 2011, Theor. Comput. Sci..
[13] Peter Kuchment,et al. An overview of periodic elliptic operators , 2015, 1510.00971.
[14] Stephen H. Unger,et al. Structural Equivalence of Context-Free Grammars , 1968, J. Comput. Syst. Sci..