How to Cite#

If you use stringi in research publications, please cite [2] as specified below. Thank you.

See Also#



Friedl, J.E.F. (2006). Mastering Regular Expressions. O'Reilly.


Gagolewski, M. (2022). stringi: Fast and portable character string processing in R. Journal of Statistical Software, 103(2):1–59. DOI: 10.18637/jss.v103.i02.


Gagolewski, M. (2023). Deep R Programming. Zenodo, Melbourne. ISBN 978-0-6455719-2-9. URL:, DOI: 10.5281/zenodo.7490464.


Hocking, T.D. (2019). Comparing namedCapture with other R packages for regular expressions. The R Journal, 11/2:328–346.


Hopcroft, J.E. and Ullman, J.D. (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.


Kleene, S.C. (1951). Representation of events in nerve nets and finite automata. Technical Report RM-704, The RAND Corporation, Santa Monica, CA. URL


Knuth, D., Morris, J.H., and Pratt, V. (1977). Fast pattern matching in strings. SIAM Journal on Computing, 6(2):323–350.


Knuth, D.E. and Plass, M.F. (1981). Breaking paragraphs into lines. Software: Practice and Experience, 11:1119–1184.


Rabin, M. and Scott, D. (1959). Finite automata and their decision problems. IBM Journal of Research and Development, 3:114–125.


Ritchie, D.M. and Thompson, K.L. (1970). QED text editor. Technical Report 70107-002, Bell Telephone Laboratories, Inc. URL:


Wickham, H. (2010). stringr: Modern, consistent string processing. The R Journal, 2(2):38–40.


Wickham, H., Çetinkaya-Rundel, M., and Grolemund, G. (2023). R for Data Science. O'Reilly. URL:


Xie, Y. (2015). Dynamic Documents with R and knitr. Chapman and Hall/CRC.