{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:12:28Z","timestamp":1784837548404,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540416951","type":"print"},{"value":"9783540446934","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44693-1_13","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T05:10:18Z","timestamp":1181625018000},"page":"144-157","source":"Crossref","is-referenced-by-count":18,"title":["Residual Finite State Automata"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Denis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aur\u00e9lien","family":"Lemay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alain","family":"Terlutte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,3,16]]},"reference":[{"key":"13_CR1","first-page":"166","volume":"47","author":"A. Arnold","year":"1992","unstructured":"A. Arnold, A. Dicky and M. Nivat. A note about minimal non-deterministic automata. Bulletin of the EATCS, 47:166\u2013169, June 1992.","journal-title":"Bulletin of the EATCS"},{"key":"13_CR2","unstructured":"J. A. Brzozowski. Canonical regular expressions and minimal state graphs for definite events. In Mathematical Theory of Automata, volume 12 of MRI Symposia Series, pages 52\u2013561. 1962."},{"key":"13_CR3","unstructured":"C. Carrez. On the minimalization of non-deterministic automaton. Technical report, Laboratoire de Calcul de la Facult\u00e9 des Sciences de l\u2019Universit\u00e9 de Lille, 1970."},{"key":"13_CR4","unstructured":"F. Denis, A. Lemay and A. Terlutte. Apprentissage de langages r\u00e9guliers \u00e1 l\u2019aide d\u2019automates non d\u00e9terministes. In CAP\u20192000, 2000."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"F. Denis, A. Lemay and A. Terlutte. Residual finite state automata. Technical Report LIFL 2000-08, L.I.F.L., 2000.","DOI":"10.1007\/3-540-44693-1_13"},{"key":"13_CR6","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completness","author":"M. R. Garey","year":"1979","unstructured":"Michael R. Garey and David S. Johnson. Computers and Intractability, a Guide to the Theory of NP-Completness. W.H. Freeman and Co, San Francisco, 1979."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"E.M. Gold. Complexity of automaton identification from given data. Inform. Control, 37:302\u2013320, 1978.","journal-title":"Inform. Control"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C. Higuera De La","year":"1997","unstructured":"Colin De La Higuera. Characteristic sets for polynomial grammatical inference. Machine Learning, 27:125\u2013137, 1997.","journal-title":"Machine Learning"},{"key":"13_CR9","unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"S. C. Kleene. Representation of events in nerve nets and finite automata. In C. Shannon and J. McCarthy, editors, Automata Studies, Annals of Math. Studies 34. New Jersey, 1956.","DOI":"10.1515\/9781400882618-002"},{"key":"13_CR11","unstructured":"J. Myhill. Finite automata and the representation of events. Technical Report 57-624, WADC, 1957."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"541","DOI":"10.2307\/2033204","volume":"9","author":"A. Nerode","year":"1958","unstructured":"A. Nerode. Linear automaton transformation. In Proc. American Mathematical Society, volume 9, pages 541\u2013544, 1958.","journal-title":"Proc. American Mathematical Society"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"J. Oncina and P. Garcia. Inferring regular languages in polynomial update time. In Pattern Recognition and Image Analysis, pages 49\u201361, 1992.","DOI":"10.1142\/9789812797902_0004"},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume":"1","author":"S. Yu","year":"1997","unstructured":"Sheng Yu. Handbook of Formal Languages, Regular Languages, volume 1, chapter 2, pages 41\u2013110. 1997.","journal-title":"Handbook of Formal Languages, Regular Languages"}],"container-title":["Lecture Notes in Computer Science","STACS 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44693-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:57:49Z","timestamp":1737093469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44693-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416951","9783540446934"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44693-1_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}