Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. C. Beeri, An improvement on Valiant's decision procedure for equivalence of deterministic finite-tunn pushdown automata, TCS 3(1976) 305–320.
2. E.P. Friedman and S.A. Greibach, On equivalence and subclass containment problems for deterministic context-free languages, Info. Proc. Let. 7 (1978) 287–290.
3. S.A. Greibach, Linearity is polynomially decidable for realtime pushdown store automata, 42(1979), 27–37.
4. M.A. Harrison, I.M. Havel and A. Yehudai, On equivalence of grammars through transformation trees, TCS 9(1979), 173–205.
5. M.A. Harrison and A. Yehudai, A hierarchy of deterministic languages, JCSS 19(1979), 63–78.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献