Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. C. Beeri. An improvement on Valiant’s decision procedure for equivalence of deterministic finite-turn pushdown automata. TCS 3, pages 305–320, 1976.
2. S. Fratani and G. Sénizergues. Iterated pushdown automata and sequences of rational numbers. Technical report, LaBRI, 2003. Draft. Pages 1–45. Available on the authors personal web-pages.
3. S. Ginsburg and S. Greibach. Deterministic context-free languages. Information and Control, pages 620–648, 1966.
4. M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978.
5. M.A. Harrison, I.M. Havel, and A. Yehudai. On equivalence of grammars through transformation trees. TCS 9, pages 173–205, 1979.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deciding Whether two Codes Have the Same Ambiguities is in co-NP;2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2022-09
2. Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines;Automatic Control and Computer Sciences;2021-12
3. On Long Words Avoiding Zimin Patterns;Theory of Computing Systems;2019-03-14
4. Equivalences of Pushdown Systems Are Hard;Lecture Notes in Computer Science;2014
5. LALBLC A Program Testing the Equivalence of dpda’s;Implementation and Application of Automata;2013