--- a/ChengsongTanPhdThesis/example.bib	Sat Mar 26 11:24:36 2022 +0000
+++ b/ChengsongTanPhdThesis/example.bib	Mon Mar 28 00:59:42 2022 +0100
@@ -57,6 +57,44 @@
 	journal = {arXiv:1405.7058},
 	title = {Static Analysis for Regular Expression Exponential Runtime via Substructural Logics},
 	year = {2017}}
+@article{campeanu2003formal,
+  title={A formal study of practical regular expressions},
+  author={C{\^a}mpeanu, Cezar and Salomaa, Kai and Yu, Sheng},
+  journal={International Journal of Foundations of Computer Science},
+  volume={14},
+  number={06},
+  pages={1007--1018},
+  year={2003},
+  publisher={World Scientific}
+}
+
+@article{alfred2014algorithms,
+  title={Algorithms for finding patterns in strings},
+  author={Alfred, V},
+  journal={Algorithms and Complexity},
+  volume={1},
+  pages={255},
+  year={2014},
+  publisher={Elsevier}
+}
+
+
+@article{CAMPEANU2009Intersect,
+title = {On the intersection of regex languages with regular languages},
+journal = {Theoretical Computer Science},
+volume = {410},
+number = {24},
+pages = {2336-2344},
+year = {2009},
+note = {Formal Languages and Applications: A Collection of Papers in Honor of Sheng Yu},
+issn = {0304-3975},
+doi = {https://doi.org/10.1016/j.tcs.2009.02.022},
+url = {https://www.sciencedirect.com/science/article/pii/S0304397509001789},
+author = {Cezar Câmpeanu and Nicolae Santean},
+keywords = {Extended regular expression, Regex automata system, Regex},
+abstract = {In this paper we revisit the semantics of extended regular expressions (regex), defined succinctly in the 90s [A.V. Aho, Algorithms for finding patterns in strings, in: Jan van Leeuwen (Ed.), Handbook of Theoretical Computer Science, in: Algorithms and Complexity, vol. A, Elsevier and MIT Press, 1990, pp. 255–300] and rigorously in 2003 by Câmpeanu, Salomaa and Yu [C. Câmpeanu, K. Salomaa, S. Yu, A formal study of practical regular expressions, IJFCS 14 (6) (2003) 1007–1018], when the authors reported an open problem, namely whether regex languages are closed under the intersection with regular languages. We give a positive answer; and for doing so, we propose a new class of machines — regex automata systems (RAS) — which are equivalent to regex. Among others, these machines provide a consistent and convenient method of implementing regex in practice. We also prove, as a consequence of this closure property, that several languages, such as the mirror language, the language of palindromes, and the language of balanced words are not regex languages.}
+}
+
 
 @article{nielson11bcre,
 	author = {Lasse Nielsen, Fritz Henglein},
@@ -77,6 +115,22 @@
 	year = {2021}
 }
 	
+@misc{KuklewiczHaskell,
+	title = {Regex Posix},
+	author = {Kuklewicz},
+	keywords = {Buggy C POSIX Lexing Libraries},
+	url = {https://wiki.haskell.org/Regex_Posix},
+	year = {2017}
+}
+
+
+@techreport{grathwohl2014crash,
+  title={A Crash-Course in Regular Expression Parsing and Regular Expressions as Types},
+  author={Grathwohl, Niels Bj{\o}rn Bugge and Henglein, Fritz and Rasmussen, Ulrik Terp},
+  year={2014},
+  institution={Technical report, University of Copenhagen}
+}
+
 @misc{SE16,
 	author = {StackStatus},
 	date-added = {2019-06-26 11:28:41 +0000},