Author:
Lisovik L. P.,Koval’ D. A.
Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. Z. Galil, “Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages,” Math. Syst. Theory, 10, 211–228 (1977).
2. W. Rytter, “A hardest language recognized by two-way nondeterministic pushdown automata,” Inform. Proc. Lett., 13, 145–146 (1981).
3. P. Duris and Z. Galil, “Fooling a two-way automaton or one pushdown store is better than one counter for two-way machines,” Theoret. Comput. Sci., 21, 39–53 (1982).
4. S. Ginzburg, Mathematical Theory of Context-Free Languages [Russian translation], Mir, Moscow (1970).
5. L. Y. Liu and P. Weiner, “A characterization of semilinear sets,” J. Comput. System. Sci., No. 4, 299–307 (1970).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bounded Parikh Automata;Electronic Proceedings in Theoretical Computer Science;2011-08-17