{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:04:47Z","timestamp":1772042687157,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540403913","type":"print"},{"value":"9783540449775","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_7","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:20:28Z","timestamp":1192530028000},"page":"77-84","source":"Crossref","is-referenced-by-count":4,"title":["Regex and Extended Regex"],"prefix":"10.1007","author":[{"given":"Cezar","family":"C\u00e2mpeanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"7_CR1","volume-title":"Perl-The Programmer\u2019s Companion","author":"N. Chapman","year":"1997","unstructured":"N. Chapman, Perl-The Programmer\u2019s Companion, Wiley, Chichester, 1997."},{"key":"7_CR2","volume-title":"Mastering Regular Expressions","author":"J. E.F. Friedl","year":"1997","unstructured":"Jeffrey E.F. Friedl Mastering Regular Expressions, O\u2019Reilly & Associates, Inc., Cambridge, 1997."},{"key":"7_CR3","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, 1979."},{"key":"7_CR4","series-title":"Computer Science Technical Report","first-page":"39","volume-title":"Lex-a lexical analyzer generator","author":"M.E. Lesk","year":"1975","unstructured":"M.E. Lesk, \u201cLex-a lexical analyzer generator\u201d, Computer Science Technical Report (1975) 39, AT&T Bell Laboratories, Murray Hill, N.J."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"S. Yu, \u201cRegular Languages\u201d, in Handbook of Formal Languages, G. Rozenberg and A. Salomaa eds. pps. 41\u2013110, Springer, 1998.","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44977-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T16:23:30Z","timestamp":1556900610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}