Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Autebert, J., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, S. (ed.) Handbook of Formal Languages, vol. 1, pp. 111–174. Springer, Berlin (1997)
2. Baader, F., Küsters, R.: Solving linear equations over regular languages. In: Proceedings of the 15th International Workshop on Unification (UNIF 2001), Siena, Italy, June 18-19, pp. 27–31 (2001)
3. Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences 8, 315–332 (1974)
4. Culik II, K., Gruska, J., Salomaa, A.: Systolic trellis automata, I and II. International Journal of Computer Mathematics 15, 195–212 (1984)
5. Fernau, H.: Nonterminal complexity of programmed grammars. Theoretical Computer Science 296, 225–251 (2003)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献