--- a/ChengsongTanPhdThesis/example.bib Sat Nov 12 00:37:23 2022 +0000
+++ b/ChengsongTanPhdThesis/example.bib Sat Nov 12 21:34:40 2022 +0000
@@ -112,25 +112,129 @@
+%% -------------------------------------
%% back-references--------------------
-@incollection{AHO1990255,
-title = {CHAPTER 5 - Algorithms for Finding Patterns in Strings},
-editor = {JAN {VAN LEEUWEN}},
-booktitle = {Algorithms and Complexity},
-publisher = {Elsevier},
-address = {Amsterdam},
-pages = {255-300},
-year = {1990},
-series = {Handbook of Theoretical Computer Science},
-isbn = {978-0-444-88071-0},
-doi = {https://doi.org/10.1016/B978-0-444-88071-0.50010-2},
-url = {https://www.sciencedirect.com/science/article/pii/B9780444880710500102},
-author = {Alfred V. AHO},
-abstract = {Publisher Summary
-This chapter discusses the algorithms for solving string-matching problems that have proven useful for text-editing and text-processing applications. String pattern matching is an important problem that occurs in many areas of science and information processing. In computing, it occurs naturally as part of data processing, text editing, term rewriting, lexical analysis, and information retrieval. Many text editors and programming languages have facilities for matching strings. In biology, string-matching problems arise in the analysis of nucleic acids and protein sequences, and in the investigation of molecular phylogeny. String matching is also one of the central and most widely studied problems in theoretical computer science. The simplest form of the problem is to locate an occurrence of a keyword as a substring in a sequence of characters, which is called the input string. For example, the input string queueing contains the keyword ueuei as a substring. Even for this problem, several innovative, theoretically interesting algorithms have been devised that run significantly faster than the obvious brute-force method.}
+@article{FERNAU2015287,
+title = {Pattern matching with variables: A multivariate complexity analysis},
+journal = {Information and Computation},
+volume = {242},
+pages = {287-305},
+year = {2015},
+issn = {0890-5401},
+doi = {https://doi.org/10.1016/j.ic.2015.03.006},
+url = {https://www.sciencedirect.com/science/article/pii/S0890540115000218},
+author = {H.~Fernau and M.L.~Schmid},
+keywords = {Parameterised pattern matching, Function matching, NP-completeness, Membership problem for pattern languages, Morphisms},
+abstract = {A pattern α, i.e., a string that contains variables and terminals, matches a terminal word w if w can be obtained by uniformly substituting the variables of α by terminal words. Deciding whether a given terminal word matches a given pattern is NP-complete and this holds for several natural variants of the problem that result from whether or not variables can be erased, whether or not the patterns are required to be terminal-free or whether or not the mapping of variables to terminal words must be injective. We consider numerous parameters of this problem (i.e., number of variables, length of w, length of the words substituted for variables, number of occurrences per variable, cardinality of the terminal alphabet) and for all possible combinations of the parameters (and variants described above), we answer the question whether or not the problem is still NP-complete if these parameters are bounded by constants.}
+}
+
+@inproceedings{Schmid2012,
+author = {M.L.~Schmid},
+title = {Inside the Class of REGEX Languages},
+year = {2012},
+isbn = {9783642316524},
+publisher = {Springer-Verlag},
+address = {Berlin, Heidelberg},
+url = {https://doi.org/10.1007/978-3-642-31653-1_8},
+doi = {10.1007/978-3-642-31653-1_8},
+abstract = {We study different possibilities of combining the concept of homomorphic replacement with regular expressions in order to investigate the class of languages given by extended regular expressions with backreferences (REGEX). It is shown in which regard existing and natural ways to do this fail to reach the expressive power of REGEX. Furthermore, the complexity of the membership problem for REGEX with a bounded number of backreferences is considered.},
+booktitle = {Proceedings of the 16th International Conference on Developments in Language Theory},
+pages = {73–84},
+numpages = {12},
+keywords = {extended regular expressions, pattern languages, REGEX, pattern expressions, homomorphic replacement},
+location = {Taipei, Taiwan},
+series = {DLT'12}
+}
+
+
+
+@article{BERGLUND2022,
+title = {Re-examining regular expressions with backreferences},
+journal = {Theoretical Computer Science},
+year = {2022},
+issn = {0304-3975},
+doi = {https://doi.org/10.1016/j.tcs.2022.10.041},
+url = {https://www.sciencedirect.com/science/article/pii/S0304397522006570},
+author = {Martin Berglund and Brink {van der Merwe}},
+keywords = {Regular expressions, Backreferences},
+abstract = {Most modern regular expression matching libraries (one of the rare exceptions being Google's RE2) allow backreferences, operations which bind a substring to a variable, allowing it to be matched again verbatim. However, both real-world implementations and definitions in the literature use different syntactic restrictions and have differences in the semantics of the matching of backreferences. Our aim is to compare these various flavors by considering the classes of formal languages that each can describe, establishing, as a result, a hierarchy of language classes. Beyond the hierarchy itself, some complexity results are given, and as part of the effort on comparing language classes new pumping lemmas are established, old classes are extended to new ones, and several incidental results on the nature of these language classes are given.}
}
+@article{FREYDENBERGER20191,
+title = {Deterministic regular expressions with back-references},
+journal = {Journal of Computer and System Sciences},
+volume = {105},
+pages = {1-39},
+year = {2019},
+issn = {0022-0000},
+doi = {https://doi.org/10.1016/j.jcss.2019.04.001},
+url = {https://www.sciencedirect.com/science/article/pii/S0022000018301818},
+author = {Dominik D. Freydenberger and Markus L. Schmid},
+keywords = {Deterministic regular expression, Regex, Glushkov automaton},
+abstract = {Most modern libraries for regular expression matching allow back-references (i.e., repetition operators) that substantially increase expressive power, but also lead to intractability. In order to find a better balance between expressiveness and tractability, we combine these with the notion of determinism for regular expressions used in XML DTDs and XML Schema. This includes the definition of a suitable automaton model, and a generalization of the Glushkov construction. We demonstrate that, compared to their non-deterministic superclass, these deterministic regular expressions with back-references have desirable algorithmic properties (i.e., efficiently solvable membership problem and some decidable problems in static analysis), while, at the same time, their expressive power exceeds that of deterministic regular expressions without back-references.}
+}
+@InProceedings{Frey2013,
+ author = {Dominik D. Freydenberger},
+ title = {{Extended Regular Expressions: Succinctness and Decidability}},
+ booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) },
+ pages = {507--518},
+ series = {Leibniz International Proceedings in Informatics (LIPIcs)},
+ ISBN = {978-3-939897-25-5},
+ ISSN = {1868-8969},
+ year = {2011},
+ volume = {9},
+ editor = {Thomas Schwentick and Christoph D{\"u}rr},
+ publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
+ address = {Dagstuhl, Germany},
+ URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3039},
+ URN = {urn:nbn:de:0030-drops-30396},
+ doi = {10.4230/LIPIcs.STACS.2011.507},
+ annote = {Keywords: extended regular expressions, regex, decidability, non-recursive tradeoffs}
+}
+
+
+
+%% -------------------------- campeanu related
+@article{campeanu2003formal,
+ author = {C.~C{\^a}mpeanu and K.~Salomaa and S.~Yu},
+ journal = {International Journal of Foundations of Computer Science},
+ number = {06},
+ pages = {1007--1018},
+ publisher = {World Scientific},
+ title = {A formal study of practical regular expressions},
+ volume = {14},
+ year = {2003}}
+
+@article{campeanu2009patterns,
+author = {C.~C{\^a}mpeanu and N.~Santean},
+year = {2009},
+month = {05},
+pages = {193-207},
+title = {On the closure of pattern expressions languages under intersection with regular languages},
+volume = {46},
+journal = {Acta Inf.},
+doi = {10.1007/s00236-009-0090-y}
+}
+
+@article{CAMPEANU2009Intersect,
+ 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{\^a}mpeanu, Salomaa and Yu [C. C{\^a}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.},
+ author = {Cezar C{\^a}mpeanu and Nicolae Santean},
+ doi = {https://doi.org/10.1016/j.tcs.2009.02.022},
+ issn = {0304-3975},
+ journal = {Theoretical Computer Science},
+ keywords = {Extended regular expression, Regex automata system, Regex},
+ note = {Formal Languages and Applications: A Collection of Papers in Honor of Sheng Yu},
+ number = {24},
+ pages = {2336-2344},
+ title = {On the intersection of regex languages with regular languages},
+ url = {https://www.sciencedirect.com/science/article/pii/S0304397509001789},
+ volume = {410},
+ year = {2009},
+ bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397509001789},
+ bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2009.02.022}}
+
%% back-references--------------------
+%% -------------------------------------
@article{fowler2003,
title={An interpretation of the POSIX regex standard},
@@ -276,15 +380,6 @@
title = {Static Analysis for Regular Expression Exponential Runtime via Substructural Logics},
year = {2017}}
-@article{campeanu2003formal,
- author = {C{\^a}mpeanu, Cezar and Salomaa, Kai and Yu, Sheng},
- journal = {International Journal of Foundations of Computer Science},
- number = {06},
- pages = {1007--1018},
- publisher = {World Scientific},
- title = {A formal study of practical regular expressions},
- volume = {14},
- year = {2003}}
@article{alfred2014algorithms,
author = {Alfred, V},
@@ -295,23 +390,7 @@
volume = {1},
year = {2014}}
-@article{CAMPEANU2009Intersect,
- 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{\^a}mpeanu, Salomaa and Yu [C. C{\^a}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.},
- author = {Cezar C{\^a}mpeanu and Nicolae Santean},
- doi = {https://doi.org/10.1016/j.tcs.2009.02.022},
- issn = {0304-3975},
- journal = {Theoretical Computer Science},
- keywords = {Extended regular expression, Regex automata system, Regex},
- note = {Formal Languages and Applications: A Collection of Papers in Honor of Sheng Yu},
- number = {24},
- pages = {2336-2344},
- title = {On the intersection of regex languages with regular languages},
- url = {https://www.sciencedirect.com/science/article/pii/S0304397509001789},
- volume = {410},
- year = {2009},
- bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0304397509001789},
- bdsk-url-2 = {https://doi.org/10.1016/j.tcs.2009.02.022}}
-
+
@article{nielson11bcre,
author = {Lasse Nielsen, Fritz Henglein},
date-added = {2019-07-03 21:09:39 +0000},