Author:
Oyamaguchi Michio,Honda Namio,Inagaki Yasuyoshi
Reference17 articles.
1. An improvement on Valiant's decision procedure for equivalence of deterministic pushdown machines;Beeri;Theoret. Comput. Sci.,1976
2. Recursive schemes, algebraic trees and deterministic languages;Courcelle,1974
3. On the equivalence problem for realtime DPDA's;Courcelle;Bulletin EATCS,1977
4. Equivalence problems for deterministic context-free languages and monadic recursion schemes;Friedman;J. Comput. System Sci.,1977
5. Deterministic context-free languages;Ginsburg;Inform. Contr.,1966
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An approach to deciding the observational equivalence of Algol-like languages;Annals of Pure and Applied Logic;2004-12
2. Decidability of DPDA equivalence;Theoretical Computer Science;2001-03
3. L(A)=L(B)? decidability results from complete formal systems;Theoretical Computer Science;2001-01
4. An Introduction to Decidability of DPDA Equivalence;FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science;2001
5. On the Complexity of Bisimulation Problems for Pushdown Automata;Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics;2000