@article{BC93,
  title={{RE2C}: A more versatile scanner generator},
  author={Bumbulis, Peter and Cowan, Donald D},
  journal={ACM Letters on Programming Languages and Systems (LOPLAS)},
  volume={2},
  number={1-4},
  pages={70--84},
  year={1993},
  publisher={ACM}
}

@misc{RE2C,
  key={RE2C},
  title={{RE2C}: lexer generator for {C}},
  howpublished="URL: \url{http://re2c.org}, URL: \url{http://github.com/skvadrik/re2c}"
}

@misc{RE2,
  key={RE2},
  title={{RE2}: regular expression library},
  howpublished="URL: \url{http://github.com/google/re2}"
}

@misc{Regex-TDFA,
  author={Kuklewicz, Chris},
  title={{Regex-TDFA}: {POSIX}-compliant regular expression library for {Haskell}},
  howpublished="URL: \url{http://hackage.haskell.org/package/regex-tdfa}"
}

@inproceedings{Lau00,
  title={{NFA}s with tagged transitions, their conversion to deterministic automata and application to regular expressions},
  author={Laurikari, Ville},
  booktitle={String Processing and Information Retrieval, 2000. SPIRE 2000. Proceedings. Seventh International Symposium on},
  pages={181--187},
  year={2000},
  note="URL: \url{http://laurikari.net/ville/spire2000-tnfa.pdf}",
  organization={IEEE}
}

@article{Lau01,
  author={Laurikari, Ville},
  title={Efficient submatch addressing for regular expressions},
  journal={Helsinki University of Technology},
  note="URL: \url{http://laurikari.net/ville/regex-submatch.pdf}",
  year={2001}
}

@misc{Kuk07,
  author={Kuklewicz, Chris},
  title={Regular expressions/bounded space proposal},
  year={2007},
  howpublished="URL: \url{http://wiki.haskell.org/index.php?title=Regular_expressions/Bounded_space_proposal&oldid=11475},
    alternative URL: \url{https://web.archive.org/web/20170808092516/https://wiki.haskell.org/index.php?title=Regular_expressions/Bounded_space_proposal&oldid=11475}"
}

@misc{Cox10,
  title={Regular expression matching in the wild},
  author={Cox, Russ},
  year={2010},
  howpublished="URL: \url{http://swtch.com/~rsc/regexp/regexp3.html}"
}

@misc{Cox17,
  title={Comments on {RE2} bug tracker},
  author={Cox, Russ},
  year={2017},
  howpublished="URL: \url{http://github.com/google/re2/issues/146}"
}

@book{Kar14,
  title={Efficient regular expressions that produce parse trees},
  author={Karper, Aaron},
  year={2014},
  publisher={epubli GmbH}
}

@phdthesis{Gra15,
  title={Parsing with Regular Expressions \& Extensions to {K}leene Algebra},
  author={Grathwohl, Niels Bj{\o}rn Bugge},
  year={2015},
  school={DIKU, University of Copenhagen}
}

@article{GHRST16,
  title={{Kleenex}: Compiling nondeterministic transducers to deterministic streaming transducers},
  author={Grathwohl, Bj{\o}rn Bugge and Henglein, Fritz and Rasmussen, Ulrik Terp and S{\o}holm, Kristoffer Aalund and T{\o}rholm, Sebastian Paaske},
  journal={ACM SIGPLAN Notices},
  volume={51},
  number={1},
  pages={284--297},
  year={2016},
  publisher={ACM}
}

@inproceedings{BT10,
  title={Typed and unambiguous pattern matching on strings using regular expressions},
  author={Brabrand, Claus and Thomsen, Jakob G},
  booktitle={Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming},
  pages={243--254},
  year={2010},
  organization={ACM}
}

@article{Koz94,
  title={A completeness theorem for {Kleene} algebras and the algebra of regular events},
  author={Kozen, Dexter},
  journal={Information and computation},
  volume={110},
  number={2},
  pages={366--390},
  year={1994},
  publisher={Elsevier}
}

@techreport{Kle51,
  title={Representation of events in nerve nets and finite automata},
  author={Kleene, Stephen Cole},
  year={1951},
  institution={RAND Project US Air Force}
}

@article{Kle56,
  title={Representation of events in nerve nets and finite automata},
  journal={In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies},
  pages={3–41},
  publisher={Princeton University Press, Princeton},
  author={Kleene, Stephen Cole},
  year={1956}
}

@misc{LTU,
  key={LTU},
  title={{Lambda The Ultimate}: comments on thread ``Regular Expression Matching Can Be Simple And Fast''},
  year={2007},
  howpublished="URL: \url{http://lambda-the-ultimate.org/node/2064},
    alternative URL: \url{http://web.archive.org/web/20170808091628/http://lambda-the-ultimate.org/node/2064}"
}

@book{HU90,
  title={Introduction To Automata Theory, Languages, And Computation},
  edition={1st},
  author={Hopcroft, John E. and Ullman, Jeffrey D.},
  publisher={Addison-Wesley Longman Publishing Co., Inc. Boston, MA, USA ©1990},
  year={1990}
}

@book{SS88,
  title={Parsing Theory},
  volume={1: Languages and Parsing},
  author={Sippu, Seppo and Soisalon-Soininen, Eljas},
  year={1988},
  publisher={Springer}
}

@book{Ber13,
  title={Transductions and context-free languages},
  author={Berstel, Jean},
  year={2013},
  publisher={Springer-Verlag}
}

@book{Cor09,
  title={Introduction to algorithms},
  edition={3rd},
  author={Cormen, Thomas H},
  year={2009},
  publisher={MIT press}
}

@article{GR93,
  title={A heuristic improvement of the {Bellman-Ford} algorithm},
  author={Goldberg, Andrew V and Radzik, Tomasz},
  journal={Applied Mathematics Letters},
  volume={6},
  number={3},
  pages={3--6},
  year={1993},
  publisher={Elsevier}
}

@article{CGR96,
  title={Shortest paths algorithms: Theory and experimental evaluation},
  author={Cherkassky, Boris V and Goldberg, Andrew V and Radzik, Tomasz},
  journal={Mathematical programming},
  volume={73},
  number={2},
  pages={129--174},
  year={1996},
  publisher={Springer}
}

@article{SW81,
  title={Properties of labeling methods for determining shortest path trees},
  author={Shier, Douglas R and Witzgall, Christoph},
  journal={Journal of Research of the National Bureau of Standards},
  volume={86},
  number={3},
  pages={317--330},
  year={1981}
}

@misc{NPX99,
  title={{SPT\_L} shortest path algorithms: review, new proposals and some experimental results},
  author={Nonato, Maddalena and Pallottino, Stefano and Xuewen, Bao},
  year={1999},
  publisher={Universit{\`a} di Pisa}
}

@misc{Tro17,
  title={Fork of the test suite for shortest path algorithms by {Cherkassky}, {Goldberg}, {Radzik}},
  author={Trofimovich, Ulya},
  year={2017},
  howpublished="URL: \url{https://github.com/skvadrik/cherkassky_goldberg_radzik}"
}

@manual{POSIX,
  key={POSIX},
  title={{POSIX-1.2008}
    a.k.a. {IEEE Std 1003.1-2008}
    a.k.a {The Open Group Technical Standard Base Specifications, Issue 7}},
  edition={2016},
  organization={The IEEE and The Open Group},
  year={2001-2016}
}

@misc{Fow03,
  title={An {I}nterpretation of the {POSIX} {R}egex {S}tandard},
  author={Fowler, Glenn},
  year={2003},
  howpublished="URL: \url{https://web.archive.org/web/20050408073627/http://www.research.att.com/~gsf/testregex/re-interpretation.html}"
}

@misc{Kuk09,
  author={Kuklewicz, Chris},
  title={Regex-POSIX-unittest: unit tests for the plaform's {POSIX} regex library},
  year={2009},
  howpublished="URL: \url{http://hackage.haskell.org/package/regex-posix-unittest-1.1}"
}

@inproceedings{AC11,
  title={Streaming transducers for algorithmic verification of single-pass list-processing programs},
  author={Alur, Rajeev and {\v{C}}ern{\`y}, Pavol},
  booktitle={ACM SIGPLAN Notices},
  volume={46},
  pages={599--610},
  year={2011},
  organization={ACM}
}

@phdthesis{Bec09,
  title={Data structures, algorithms and architectures for efficient regular expression evaluation},
  author={Becchi, Michela},
  year={2009},
  school={Washington University In St. Louis, School of Engineering and Applied Science, Department of Computer Science and Engineering}
}

@book{SSA,
  title={{Static} {Single} {Assignment} {Book}},
  author={{Lots of authors}},
  year={2015},
  publisher={Springer},
  note="URL: \url{http://ssabook.gforge.inria.fr/latest/book.pdf}"
}

@article{Gro89,
  title={Efficient Generation of Table-Driven Scanners},
  author={Grosch, Josef},
  journal={Software Practice and Experience 19},
  year={1989},
  pages={1089--1103}
}

@article{CH11,
  title={QuickCheck: a lightweight tool for random testing of Haskell programs},
  author={Claessen, Koen and Hughes, John},
  journal={Acm sigplan notices},
  volume={46},
  number={4},
  pages={53--64},
  year={2011},
  publisher={ACM}
}

@misc{TRE,
  key={TRE},
  title={{TRE}: The free and portable approximate regex matching library},
  howpublished="URL: \url{http://laurikari.net/tre/}, URL: \url{http://github.com/laurikari/tre/}"
}

@article{RFC-3986,
  title={{U}niform {R}esource {I}dentifier ({URI}): {G}eneric {S}yntax},
  author={Berners-Lee, Tim and Fielding, Roy and Masinter, Larry},
  year={2005},
  journal={Internet Engineering Task Force (IETF)},
  note="URL: \url{http://tools.ietf.org/html/rfc3986}"
}

@article{RFC-7230,
  title={{H}ypertext {T}ransfer {P}rotocol ({HTTP/1.1}): {M}essage {S}yntax and {R}outing},
  author={Fielding, Roy and Reschke, Julian},
  year={2014},
  journal={Internet Engineering Task Force (IETF)},
  note="URL: \url{http://tools.ietf.org/html/rfc7230}"
}

@misc{GCC,
  key={GCC},
  title={{GCC}, the {GNU} {C}ompiler {C}ollection}},
  howpublished="URL: \url{http://gcc.gnu.org/}"
}

@misc{CLANG,
  key={Clang},
  title={{Clang}: a {C} language family frontend for {LLVM}},
  howpublished="URL: \url{http://clang.llvm.org/}"
}

@misc{TCC,
  key={TCC},
  title={{T}iny {C} {C}ompiler},
  howpublished="URL: \url{http://bellard.org/tcc/}"
}

@misc{PCC,
  key={PCC},
  title={{PCC}, the {P}ortable {C} {C}ompiler},
  howpublished="URL: \url{http://pcc.ludd.ltu.se/}"
}

@article{Wat93,
  title={A taxonomy of finite automata construction algorithms},
  author={Watson, Bruce William},
  year={1993},
  journal={Eindhoven University of Technology, Department of Mathematics and Computing Science, Computing Science Section}
}

@misc{BSU,
  key={BSU},
  title={{B}elarusian {S}tate {U}niversity},
  howpublished="URL: \url{http://bsu.by/}"
}

