{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:54:20Z","timestamp":1725555260164},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130885"},{"type":"electronic","value":"9783642130892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13089-2_48","type":"book-chapter","created":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T12:05:27Z","timestamp":1273233927000},"page":"573-584","source":"Crossref","is-referenced-by-count":1,"title":["Some Minimality Results on Biresidual and Biseparable Automata"],"prefix":"10.1007","author":[{"given":"Hellis","family":"Tamm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J.C. Birget","year":"1992","unstructured":"Birget, J.C.: Intersection and union of regular languages and state complexity. Information Processing Letters\u00a043, 185\u2013190 (1992)","journal-title":"Information Processing Letters"},{"key":"48_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-44693-1_13","volume-title":"STACS 2001","author":"F. Denis","year":"2001","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Residual finite state automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 144\u2013157. Springer, Heidelberg (2001)"},{"key":"48_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(96)00095-6","volume":"59","author":"I. Glaister","year":"1996","unstructured":"Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Information Processing Letters\u00a059, 75\u201377 (1996)","journal-title":"Information Processing Letters"},{"key":"48_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/11779148_33","volume-title":"Developments in Language Theory","author":"H. Gruber","year":"2006","unstructured":"Gruber, H., Holzer, M.: Finding lower bounds for nondeterministic state complexity is hard. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 363\u2013374. Springer, Heidelberg (2006)"},{"key":"48_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/FI-2009-0008","volume":"90","author":"Y.S. Han","year":"2009","unstructured":"Han, Y.S., Salomaa, K., Wood, D.: Nondeterministic state complexity of basic operations for prefix-free regular languages. Fundam. Inform.\u00a090, 93\u2013106 (2009)","journal-title":"Fundam. Inform."},{"key":"48_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-540-30500-2_18","volume-title":"Implementation and Application of Automata","author":"S. John","year":"2005","unstructured":"John, S.: Minimal unambiguous \u03b5-NFA. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 190\u2013201. Springer, Heidelberg (2005)"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.tcs.2006.01.029","volume":"356","author":"M. Latteux","year":"2006","unstructured":"Latteux, M., Lemay, A., Roos, Y., Terlutte, A.: Identification of biRFSA languages. Theoretical Computer Science\u00a0356, 212\u2013223 (2006)","journal-title":"Theoretical Computer Science"},{"key":"48_CR8","unstructured":"Latteux, M., Roos, Y., Terlutte, A.: BiRFSA languages and minimal NFAs. Technical Report GRAPPA-0205, GRAPPA (2005)"},{"issue":"2","key":"48_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1051\/ita:2008022","volume":"43","author":"M. Latteux","year":"2009","unstructured":"Latteux, M., Roos, Y., Terlutte, A.: Minimal NFA and biRFSA languages. RAIRO - Theoretical Informatics and Applications\u00a043(2), 221\u2013237 (2009)","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"issue":"3","key":"48_CR10","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1142\/S0129054108005887","volume":"19","author":"H. Tamm","year":"2008","unstructured":"Tamm, H.: On transition minimality of bideterministic automata. International Journal of Foundations of Computer Science\u00a019(3), 677\u2013690 (2008)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2004.07.010","volume":"328","author":"H. Tamm","year":"2004","unstructured":"Tamm, H., Ukkonen, E.: Bideterministic automata and minimal representations of regular languages. Theoretical Computer Science\u00a0328, 135\u2013149 (2004)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13089-2_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:04Z","timestamp":1606186864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13089-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130885","9783642130892"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13089-2_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}