Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. Context-free languages;Autebert,1996
2. J. Baeten, J. Bergstra, J. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, in Proceedings of PARLE 87, Lecture Notes in Computer Science, vol. 259, Springer, Berlin, 1987, pp. 94–111.
3. Rational Series and their Languages;Berstel,1988
4. A fast algorithm to decide on the equivalence of stateless dpda;Caucal;RAIRO Theoret. Inform. Appl.,1993
5. D. Caucal, Bisimulation of context-free grammars and of pushdown automata, in: Modal Logic and Process Algebra, CSLI Lectures Notes, vol. 53, 1995, pp. 85–106.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献