Publisher
Springer Berlin Heidelberg
Reference86 articles.
1. Andretta, A., Camerlo, R.: The use of complexity hierarchies in descriptive set theory and automata theory. Task Quarterly 9(3), 337–356 (2005)
2. Lecture Notes in Computer Science;A. Arnold,1983
3. Autebert, J.-M., Berstel, J., Boasson, L.: Context free languages and pushdown automata. In: Handbook of Formal Languages, vol. 1. Springer (1996)
4. Lecture Notes in Computer Science;D. Beauquier,1984
5. Berstel, J.: Transductions and context free languages. Teubner Studienbücher Informatik (1979)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献