You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: tex/FormalLanguageConstrainedReachabilityLectureNotes.bib
+35Lines changed: 35 additions & 0 deletions
Original file line number
Diff line number
Diff line change
@@ -2007,3 +2007,38 @@ @article{chomsky1958finite
2007
2007
}
2008
2008
2009
2009
@article{OWENS_REPPY_TURON_2009, title={Regular-expression derivatives re-examined}, volume={19}, DOI={10.1017/S0956796808007090}, number={2}, journal={Journal of Functional Programming}, author={OWENS, SCOTT and REPPY, JOHN and TURON, AARON}, year={2009}, pages={173–190}} <div></div>
2010
+
2011
+
@article{10.1145/363347.363387,
2012
+
author = {Thompson, Ken},
2013
+
title = {Programming Techniques: Regular expression search algorithm},
2014
+
year = {1968},
2015
+
issue_date = {June 1968},
2016
+
publisher = {Association for Computing Machinery},
2017
+
address = {New York, NY, USA},
2018
+
volume = {11},
2019
+
number = {6},
2020
+
issn = {0001-0782},
2021
+
url = {https://doi.org/10.1145/363347.363387},
2022
+
doi = {10.1145/363347.363387},
2023
+
abstract = {A method for locating specific character strings embedded in character text is described and an implementation of this method in the form of a compiler is discussed. The compiler accepts a regular expression as source language and produces an IBM 7094 program as object language. The object program then accepts the text to be searched as input and produces a signal every time an embedded string in the text matches the given regular expression. Examples, problems, and solutions are also presented.},
0 commit comments