{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:19:30Z","timestamp":1740097170999,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662460771"},{"type":"electronic","value":"9783662460788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46078-8_28","type":"book-chapter","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T09:54:29Z","timestamp":1421229269000},"page":"339-351","source":"Crossref","is-referenced-by-count":1,"title":["Optimal State Reductions of Automata with Partially Specified Behaviors"],"prefix":"10.1007","author":[{"given":"Nelma","family":"Moreira","sequence":"first","affiliation":[]},{"given":"Giovanni","family":"Pighizzini","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-00768-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y.-F. Chen","year":"2009","unstructured":"Chen, Y.-F., Farzan, A., Clarke, E.M., Tsay, Y.-K., Wang, B.-Y.: Learning minimal separating dFA\u2019s for compositional verification. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol.\u00a05505, pp. 31\u201345. Springer, Heidelberg (2009)"},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theor. Comput. Sci.\u00a047(3), 149\u2013158 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"11","key":"28_CR3","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1109\/43.663818","volume":"16","author":"M. Damiani","year":"1997","unstructured":"Damiani, M.: The state reduction of nondeterministic finite-state machines. IEEE Trans. CAD\u00a016(11), 1278\u20131291 (1997)","journal-title":"IEEE Trans. CAD"},{"issue":"1-3","key":"28_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10703-008-0057-6","volume":"33","author":"J. Eisinger","year":"2008","unstructured":"Eisinger, J., Klaedtke, F.: Don\u2019t care words with an application to the automata-based approach for real addition. Formal Methods in System Design\u00a033(1-3), 85\u2013115 (2008), \n                      \n                        http:\/\/dx.doi.org\/10.1007\/s10703-008-0057-6","journal-title":"Formal Methods in System Design"},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s00453-010-9479-9","volume":"63","author":"V. Geffert","year":"2012","unstructured":"Geffert, V., Pighizzini, G.: Pairs of complementary unary languages with \u201cbalanced\u201d nondeterministic automata. Algorithmica\u00a063(3), 571\u2013587 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"28_CR6","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Inf. Contr.\u00a037(3), 302\u2013320 (1978)","journal-title":"Inf. Contr."},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.ic.2010.11.017","volume":"209","author":"G. Jir\u00e1skov\u00e1","year":"2011","unstructured":"Jir\u00e1skov\u00e1, G., Pighizzini, G.: Optimal simulation of self-verifying automata by deterministic automata. Inf. Comput.\u00a0209(3), 528\u2013535 (2011)","journal-title":"Inf. Comput."},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Kam, T., Villa, T., Brayton, R., Sangiovanni-Vincentelli, A.: A fully implicit algorithm for exact state minimization. In: Proc. ACM\/IEEE Design Automation Conf., pp. 684\u2013690 (1994)","DOI":"10.1145\/196244.196615"},{"issue":"11","key":"28_CR9","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1109\/43.663820","volume":"16","author":"T. Kam","year":"1997","unstructured":"Kam, T., Villa, T., Brayton, R., Sangiovanni-Vincentelli, A.: Theory and algorithms for state minimization of nondeterministic FSMs. IEEE Trans. CAD\u00a016(11), 1311\u20131322 (1997)","journal-title":"IEEE Trans. CAD"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J. Moon","year":"1965","unstructured":"Moon, J., Moser, L.: On cliques in graphs. Israel J. Math\u00a03, 23\u201328 (1965)","journal-title":"Israel J. Math"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1109\/TEC.1959.5222697","volume":"3","author":"M.C. Paull","year":"1959","unstructured":"Paull, M.C., Unger, S.H.: Minimizing the number of states in incompletely specified sequential switching functions. IRE Trans. on Elect. Comput.\u00a03, 356\u2013367 (1959)","journal-title":"IRE Trans. on Elect. Comput."},{"issue":"11","key":"28_CR12","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1109\/43.806807","volume":"18","author":"J.M. Pena","year":"1999","unstructured":"Pena, J.M., Oliveira, A.L.: A new algorithm for exact reduction of incompletely specified finite state machines. IEEE Trans. CAD\u00a018(11), 1619\u20131632 (1999)","journal-title":"IEEE Trans. CAD"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Pfleeger, C.P.: State reduction in incompletely specified finite-state machines. IEEE Trans. Comput. 22(C), 1099\u20131102 (1973)","DOI":"10.1109\/T-C.1973.223655"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/43.259940","volume":"13","author":"J.K. Rho","year":"1994","unstructured":"Rho, J.K., Hachtel, G., Somenzi, F., Jacoby, R.: Exact and heuristic algorithms for the minimization of incompletely specified state machines. IEEE Trans. CAD\u00a013, 167\u2013177 (1994)","journal-title":"IEEE Trans. CAD"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2015: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46078-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:58:39Z","timestamp":1559087919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46078-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662460771","9783662460788"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46078-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}