Author:
Jirásková Galina,Klíma Ondřej
Publisher
Springer International Publishing
Reference16 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, vol. 1, pp. 111–174. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59136-5_3
2. Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. J. Comput. Syst. Sci. 8(3), 315–332 (1974)
3. Bedregal, B.R.C.: Some subclasses of linear languages based on nondeterministic linear automata. Preprint (2016). http://arxiv.org/abs/1611.10276
4. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);C Higuera de la,2002
5. Holzer, M., Jakobi, S.: Minimization and characterizations for biautomata. Fundam. Informaticae 136(1–2), 113–137 (2015)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献