{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:46:30Z","timestamp":1725493590690},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405610"},{"type":"electronic","value":"9783540450894"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45089-0_31","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T03:27:35Z","timestamp":1193455655000},"page":"304-306","source":"Crossref","is-referenced-by-count":4,"title":["The Effect of Rewriting Regular Expressions on Their Accepting Automata"],"prefix":"10.1007","author":[{"given":"Michiel","family":"Frishert","sequence":"first","affiliation":[]},{"given":"Loek G.","family":"Cleophas","sequence":"additional","affiliation":[]},{"given":"Bruce W.","family":"Watson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"31_CR1","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)"},{"issue":"6","key":"31_CR2","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"Thompson, K.: Regular Expression Search Algorithm. Communications of the ACM 11(6) (1968) 419\u2013422","journal-title":"Communications of the ACM"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"V.M. Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The Abstract Theory of Automata. Russian Math. Surveys 16 (1961) 1\u201353","journal-title":"Russian Math. Surveys"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Ilie, L., Yu, S.: Constructing NFAs by Optimal Use of Positions in Regular Expressions. In: Lecture Notes in Computer Science: Proceedings of the 13th CPM, Springer-Verlag (2002) 279\u2013288","DOI":"10.1007\/3-540-45452-7_23"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Frishert, M., Watson, B.W.: The Effect of Rewriting Regular Expressions on Their Accepting Automata. Technical report, Technische Universiteit Eindhoven (2003)","DOI":"10.1007\/3-540-45089-0_31"}],"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-45089-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:08:07Z","timestamp":1556921287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45089-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405610","9783540450894"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-45089-0_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}