Author:
Balkanski Eric,Blanchet-Sadri F.,Kilgore Matthew,Wyatt B. J.
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Andrews, G.E., Eriksson, K.: Integer Partitions. Cambridge University Press (2004)
2. Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theoretical Computer Science 218, 135–141 (1999)
3. Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press, Boca Raton (2008)
4. Lecture Notes in Computer Science;J. Dassow,2012
5. Fischer, M., Paterson, M.: String matching and other products. In: Karp, R. (ed.) 7th SIAM-AMS Complexity of Computation, pp. 113–125 (1974)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Partial Petri Net Languages and their Properties;International Journal of Information Technology;2024-06-05
2. Minimal Partial Languages and Automata;Implementation and Application of Automata;2014