Author:
Kucherov Gregory,Rusinowitch Michaël
Publisher
Springer Berlin Heidelberg
Reference38 articles.
1. D. Angluin. Finding patterns common to a set of strings. J. Comput. System Sci., 21:46–62, 1980.
2. D.R. Bean, A. Ehrenfeucht, and G.F. McNulty. Avoidable patterns in strings of symbols. Pacific J. Math., 85(2):261–294, 1979.
3. J. Cassaigne. Motifs évitables et régularités dans les mots. Thèse de doctorat, Université Paris VI, 1994.
4. R. Cole, R. Hariharan, and P. Indyk. Tree pattern matching and subset matching in deterministic o(n log3 n)-time. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltymore, Maryland, January 17–19, 1999, pages 245–254. ACM, SIAM, 1999.
5. H. Comon and F. Jacquemard. Ground reducibility is EXPTIME-complete. In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, pages 26–34, Warsaw, Poland, 29 June–2 July 1997. IEEE Computer Society Press.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献