Author:
Malcher Andreas,Meckel Katja,Mereghetti Carlo,Palano Beatrice
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Autebert, J.-M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Handbook of Formal Languages, vol. 1, pp. 111–174. Springer (1997)
2. Lecture Notes in Computer Science;Z. Bednárová,2011
3. Lecture Notes in Computer Science;J. Dassow,2011
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco (1979)
5. Geffert, V., Mereghetti, C., Palano, B.: More concise representation of regular languages by automata and regular expressions. Inf. Comput. 208, 385–394 (2010)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献