Author:
Dumitran Marius,Gil Javier,Manea Florin,Mitrana Victor
Publisher
Springer International Publishing
Reference16 articles.
1. Bovet, D.P., Varricchio, S.: On the regularity of languages on a binary alphabet generated by copying systems. Inform. Proc. Letters 44(3), 119–123 (1992)
2. Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inf. Process. Lett. 12(5), 244–250 (1981)
3. Dassow, J., Mitrana, V., Păun, G.: On the regularity of duplication closure. Bull. European Assoc. Theor. Comput. Sci. 68, 133–136 (1999)
4. Ehrenfeucht, A., Rozenberg, G.: On the separating power of EOL systems. RAIRO Inform. Theor. 17(1), 13–22 (1983)
5. Frazier, M., David Page Jr., C.: Prefix grammars: an alternative characterization of the regular languages. Inf. Process. Lett. 2, 67–71 (1994)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Note on Distributivity of Different String Operations Over Language Sets;Synergies in Analysis, Discrete Mathematics, Soft Computing and Modelling;2023
2. Watson–Crick Jumping Finite Automata;International Journal of Foundations of Computer Science;2020-11
3. Prefix-Suffix Square Completion;Lecture Notes in Computer Science;2015