{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:59:09Z","timestamp":1725562749919},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144547"},{"type":"electronic","value":"9783642144554"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14455-4_36","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T11:06:02Z","timestamp":1281697562000},"page":"399-410","source":"Crossref","is-referenced-by-count":4,"title":["Automata with Extremal Minimality Conditions"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Restivo","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Vaglica","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/978-3-662-07675-0_10","volume-title":"Handbook of Formal Languages","author":"M.P. Beal","year":"1997","unstructured":"Beal, M.P., Perrin, D.: Symbolic dynamics and finite automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a02, pp. 463\u2013505. Springer, Heidelberg (1997)"},{"volume-title":"Theory of codes","year":"1985","author":"J. Berstel","key":"36_CR2","unstructured":"Berstel, J., Perrin, D.: Theory of codes. Academic Press, Inc., London (1985)"},{"issue":"3","key":"36_CR3","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/S0019-9958(67)90308-7","volume":"10","author":"J. Brzozowski","year":"1967","unstructured":"Brzozowski, J.: On Single-Loop Realizations of Sequential Machines. Information and Control\u00a010(3), 292\u2013314 (1967)","journal-title":"Information and Control"},{"issue":"8","key":"36_CR4","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s00236-009-0106-7","volume":"46","author":"A. Carpi","year":"2009","unstructured":"Carpi, A., D\u2019Alessandro, F.: Strongly transitive automata and the \u010cern\u00fd conjecture. Acta Informatica\u00a046(8), 591\u2013607 (2009)","journal-title":"Acta Informatica"},{"key":"36_CR5","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A (1974)"},{"issue":"3","key":"36_CR6","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1109\/PGEC.1966.264493","volume":"EC-15","author":"A.D. Friedman","year":"1966","unstructured":"Friedman, A.D.: Feedback in Synchronous Sequential Switching Circuits. IEEE Trans. Electronic Computers\u00a0EC-15(3), 354\u2013367 (1966)","journal-title":"IEEE Trans. Electronic Computers"},{"issue":"1","key":"36_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(74)80034-6","volume":"9","author":"A. Gill","year":"1974","unstructured":"Gill, A., Kou, L.T.: Multiple-entry finite automata. Journal of Computer and System Sciences\u00a09(1), 1\u201319 (1974)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1-2","key":"36_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(98)00034-6","volume":"204","author":"P. Goralcik","year":"1998","unstructured":"Goralcik, P., Koubek, V.: On the Disjunctive Set Problem. Theoretical Computer Science\u00a0204(1-2), 99\u2013118 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"36_CR9","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1142\/S0129054106003887","volume":"17","author":"Y.S. Han","year":"2006","unstructured":"Han, Y.S., Wang, Y., Wood, D.: Infix-free Regular Expressions and Languages. International Journal of Foundations of Computer Science\u00a017(2), 379\u2013393 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"4","key":"36_CR10","first-page":"453","volume":"6","author":"M. Holzer","year":"2001","unstructured":"Holzer, M., Salomaa, K., Yu, S.: On the state complexity of k-entry deterministic finite automata. Journal of Automata, Languages and Combinatorics\u00a06(4), 453\u2013466 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"36_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations, Proc. Internat. Sympos. Technion, Haifa","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An nlogn algorithm for minimizing the states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, Proc. Internat. Sympos. Technion, Haifa, pp. 189\u2013196. Academic Press, New York (1971)"},{"key":"36_CR12","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (1979)","edition":"2"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Kao, J.Y., Rampersd, N., Shallit, J.: On NFA\u2019s where all states are final, initial, or both. TCS 410, 5010\u20135021 (2009)","DOI":"10.1016\/j.tcs.2009.07.049"},{"key":"36_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626302","volume-title":"An introduction to symbolic dynamics and coding","author":"D. Lind","year":"1995","unstructured":"Lind, D., Marcus, B.: An introduction to symbolic dynamics and coding. Cambridge University Press, New York (1995)"},{"key":"36_CR15","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. The Journal of Symbolic Logic\u00a023(1) (1958)"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/0022-0000(79)90038-2","volume":"18","author":"P.A.S. Veloso","year":"1979","unstructured":"Veloso, P.A.S., Gill, A.: Some remarks on multiple-entry finite automata. Journal of Computer and System Sciences\u00a018, 304\u2013306 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"M.V. Volkov","year":"2008","unstructured":"Volkov, M.V.: Syncronizing automata and the \u010cern\u00fd conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 11\u201327. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14455-4_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:53:03Z","timestamp":1606168383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14455-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144547","9783642144554"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14455-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}