Author:
Bertoni Alberto,Goldwurm Massimiliano,Santini Massimo
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
2. A. V. Aho and J. D. Ullman. The Theory of Parsing, Translation and Compiling-Vol.I: Parsing. Prentice Hall, Englewood Cliffs, NJ, 1972.
3. E. Allender, D. Bruschi, and G. Pighizzini. The complexity of computing maximal word functions. Computational Complexity, 3:368–391, 1993.
4. A. Avellone and M. Goldwurm. Analysis of algorithms for the recognition of rational and context-free trace languages. RAIRO Informatique théorique et Applications/Theoretical Informatics and Applications, 32(4-5-6):141–152, 1998.
5. A. Bertoni, M. Goldwurm, G. Mauri, and N. Sabadini. Counting techniques for inclusion, equivalence and membership problems. In V. Diekert and G. Rozenberg, editors, The Book of Traces, chapter 5, pages 131–164. World Scientific, Singapore, 1995.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献