@inproceedings{10.1007/978-3-642-22321-1_4,
Abstract = {Regular expressions [4] and tools to handle them, especially tools for regular expression matching---an early one is described in the seminal paper [5] by Ken Thompson---, are one of the major achievements of formal language and automata theory. Google counts 303,000 results for ``regular expressions matching'' (May 4, 2011); there are numerous command line tools for working with regular expressions such as grep; Google released a regular expression C++ library not long ago [3]; almost every programming language provides support for regular expressions; and even the text editor I am using to produce the source code of this LaTeX document has an extensive regular expression library.},
Address = {Berlin, Heidelberg},
Author = {Wilke, Thomas},
BookTitle = {Developments in Language Theory},
Editor = {Mauri, Giancarlo and Leporati, Alberto},
ISBN = {978-3-642-22321-1},
Pages = {44--45},
Publisher = {Springer Berlin Heidelberg},
Title = {A Functional Program for Regular Expressions Matching},
Year = {2011},
date-added = {2018-03-02 06:57:19 +0000},
date-modified = {2018-03-02 06:57:19 +0000},
doi = {10.1007/978-3-642-22321-1_4}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A