A Note on Undercover Relation
暂无分享,去创建一个
[1] Arto Salomaa,et al. On the Decidability of Homomorphism Equivalence for Languages , 1978, J. Comput. Syst. Sci..
[2] Karel Culik,et al. Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid , 1982, Inf. Control..
[3] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .
[4] Sheila A. Greibach,et al. Superdeterministic PDAs , 1980, J. ACM.
[5] Etsuro Moriya,et al. Associate Languages and Derivational Complexity of Formal Grammars and Languages , 1973, Inf. Control..