Publisher
Springer International Publishing
Reference17 articles.
1. Autebert, J.M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 111–174. Springer, Heidelberg (1997).
https://doi.org/10.1007/978-3-642-59136-5_3
2. R.V. Book: Grammars with time functions. Ph.D. thesis, Harvard University, Cambridge, Massachusetts, February 1969
3. Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Inf. Comput. 141, 1–36 (1998)
4. Culik II, K., Cohen, R.: LR-regular grammars - an extension of LR
$$(k)$$
grammars. J. Comput. Syst. Sci. 7, 66–96 (1973)
5. Dahlhaus, E., Warmuth, M.: Membership for growing context-sensitive grammars is polynomial. J. Comput. Syst. Sci. 33, 456–472 (1986)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献