Author:
Dassow Jürgen,Manea Florin,Mercaş Robert
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theoretical Computer Science 218, 135–141 (1999)
2. Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall/CRC Press (2008)
3. Fischer, M.J., Paterson, M.S.: String matching and other products. In: Complexity of Computation, Proceedings of SIAM-AMS, vol. 7, pp. 113–125 (1974)
4. Lischke, G.: Restoration of punctured languages and similarity of languages. Mathematical Logic Quarterly 52(1), 20–28 (2006)
5. Manea, F., Mercaş, R.: Freeness of partial words. Theoretical Computer Science 389(1-2), 265–277 (2007)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Partial Petri Net Languages and their Properties;International Journal of Information Technology;2024-06-05
2. Two Extensions of Cover Automata;Axioms;2021-12-10
3. Partial Word DFAs;Implementation and Application of Automata;2013