{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T13:35:19Z","timestamp":1744205719545,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319644189"},{"type":"electronic","value":"9783319644196"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64419-6_49","type":"book-chapter","created":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T02:42:00Z","timestamp":1502851320000},"page":"383-391","source":"Crossref","is-referenced-by-count":3,"title":["On Minimization of Deterministic Automaton with Rough Output"],"prefix":"10.1007","author":[{"given":"B. K.","family":"Sharma","sequence":"first","affiliation":[]},{"given":"S.","family":"Sharan","sequence":"additional","affiliation":[]},{"given":"S. P.","family":"Tiwari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"key":"49_CR1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1080\/01969720590887324","volume":"36","author":"S Basu","year":"2005","unstructured":"Basu, S.: Rough finite-state machine. Cybern. Syst. 36, 107\u2013124 (2005)","journal-title":"Cybern. Syst."},{"key":"49_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-45007-6_11","volume-title":"Developments in Language Theory","author":"B Borchardt","year":"2003","unstructured":"Borchardt, B.: The myhill-nerode theorem for recognizable tree series. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 146\u2013158. Springer, Heidelberg (2003). doi: 10.1007\/3-540-45007-6_11"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Ignjatovi $$\\acute{c}$$ c \u00b4 , J., $$\\acute{C}$$ C \u00b4 iric, M., Bogdanovi $$\\acute{c}$$ c \u00b4 , S., Petkovi $$\\acute{c}$$ c \u00b4 , T.: Myhill Nerode Type Theory for fuzzy languages and automata. Fuzzy Sets Syst. 161, 1288\u20131324 (2010)","DOI":"10.1016\/j.fss.2009.06.007"},{"issue":"1","key":"49_CR4","first-page":"73","volume":"VIII","author":"J Kierczak","year":"1985","unstructured":"Kierczak, J.: Rough grammars. Fund. Inform. VIII(1), 73\u201381 (1985)","journal-title":"Fund. Inform."},{"key":"49_CR5","first-page":"170","volume":"47","author":"D Kozen","year":"1992","unstructured":"Kozen, D.: On the Myhill - Nerode theorem for trees. Bull. EATCS 47, 170\u2013173 (1992)","journal-title":"Bull. EATCS"},{"key":"49_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-540-78773-0_10","volume-title":"LATIN 2008: Theoretical Informatics","author":"A Maletti","year":"2008","unstructured":"Maletti, A.: Myhill-Nerode theorem for recognizable tree series revisited. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 106\u2013120. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-78773-0_10"},{"key":"49_CR7","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/FI-1997-32204","volume":"32","author":"G Paun","year":"1997","unstructured":"Paun, G., Polkowski, L., Skowron, A.: Rough set approximations of languages. Fund. Inform. 32, 149\u2013162 (1997)","journal-title":"Fund. Inform."},{"key":"49_CR8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough sets. Int. J. Comput. Inform. Sci. 11, 341\u2013356 (1982)","journal-title":"Int. J. Comput. Inform. Sci."},{"key":"49_CR9","doi-asserted-by":"publisher","unstructured":"Sharan, S., Srivastava, A.K., Tiwari, S.P.: Characterizations of rough finite-state automata. Int. J. Mach. Learn. Cybern. (2015). doi: 10.1007\/s13042-015-0372-3","DOI":"10.1007\/s13042-015-0372-3"},{"key":"49_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-21881-1_14","volume-title":"Rough Sets, Fuzzy Sets, Data Mining and Granular Computing","author":"SP Tiwari","year":"2011","unstructured":"Tiwari, S.P., Sharan, S.: On coverings of rough transformation semigroups. In: Kuznetsov, S.O., \u015al\u0119zak, D., Hepting, D.H., Mirkin, B.G. (eds.) RSFDGrC 2011. LNCS (LNAI), vol. 6743, pp. 79\u201386. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-21881-1_14"},{"key":"49_CR11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s12190-013-0720-y","volume":"45","author":"SP Tiwari","year":"2014","unstructured":"Tiwari, S.P., Singh, A.K.: On minimal realization of fuzzy behaviour and associated categories. J. Appl. Math. Comput. 45, 223\u2013234 (2014)","journal-title":"J. Appl. Math. Comput."},{"issue":"4\u20135","key":"49_CR12","first-page":"339","volume":"25","author":"SP Tiwari","year":"2015","unstructured":"Tiwari, S.P., Sharan, S.: Products of rough finite-state machines. J. Multiple-Valued Logic Soft Comput. 25(4\u20135), 339\u2013356 (2015)","journal-title":"J. Multiple-Valued Logic Soft Comput."},{"key":"49_CR13","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1142\/S0129054113500093","volume":"24","author":"SP Tiwari","year":"2013","unstructured":"Tiwari, S.P., Sharan, S., Singh, A.K.: On coverings of products of rough transformation semigroups. Int. J. Found. Comput. Sci. 24, 375\u2013391 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"49_CR14","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s12190-014-0782-5","volume":"47","author":"SP Tiwari","year":"2015","unstructured":"Tiwari, S.P., Yadav, V.K., Singh, A.K.: Constrution of a minimal realizatioin and monoid for a fuzzy languages: a categorical approach. J. Appl. Math. Comput. 47, 401\u2013416 (2015)","journal-title":"J. Appl. Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science and Discrete Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64419-6_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T08:35:19Z","timestamp":1602750919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64419-6_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644189","9783319644196"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64419-6_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}