{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:12Z","timestamp":1725549192553},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243182"},{"type":"electronic","value":"9783540305002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_28","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:39:36Z","timestamp":1267461576000},"page":"306-307","source":"Crossref","is-referenced-by-count":0,"title":["Tight Bounds for NFA to DFCA Transformations for Binary Alphabets"],"prefix":"10.1007","author":[{"given":"Cezar","family":"C\u00e2mpeanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"P\u0103un","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"28_CR1","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1142\/S0129054103002138","volume":"14","author":"C. C\u00e2mpeanu","year":"2003","unstructured":"C\u00e2mpeanu, C., P\u0103un, A.: Counting The Number of Minimal DFCA Obtained by Merging States. International Journal of Foundations of Computer Science\u00a014(6), 995\u20131006 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1-2","key":"28_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00292-9","volume":"267","author":"C. C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., S\u00e2ntean, N., Yu, S.: Finite Languages and Cover Automata. Theoretical Computer Science\u00a0267(1-2), 3\u201316 (2001)","journal-title":"Theoretical Computer Science"},{"key":"28_CR3","first-page":"177","volume":"2","author":"K. Salomaa","year":"1997","unstructured":"Salomaa, K., Yu, S.: NFA to DFA transformations for finite languages over arbitrary alphabets. Journal of Automata, Languages and Combinatorics\u00a02, 177\u2013186 (1997)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S. Yu","year":"1997","unstructured":"Yu, S.: Regular Languages. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, pp. 41\u2013110. Springer, Berlin (1997)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30500-2_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:15Z","timestamp":1605761835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30500-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}