{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:16Z","timestamp":1759638256643},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428121"},{"type":"electronic","value":"9783540455264"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45526-4_1","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T05:12:00Z","timestamp":1185858720000},"page":"1-12","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["FA Minimisation Heuristics for a Class of Finite Languages"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00f4me","family":"Amilhastre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Janssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Catherine","family":"Vilarem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,16]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0166-218X(98)00039-0","volume":"86","author":"J. Amilhastre","year":"1998","unstructured":"J. Amilhastre, M. C. Vilarem, and P. Janssen. Complexity of minimum biclique cover and decomposition for bipartite domino-free graphs. Discrete Applied Mathematics, 86(2):125\u2013144, September 1998.","journal-title":"Discrete Applied Mathematics"},{"issue":"35-6","key":"1_CR2","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C","author":"R.E. Bryant","year":"1986","unstructured":"R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C(35-6):677\u2013691, 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"J. Daciuk, W. Watson, and B.W. Watson. Incremental construction of minimal acyclic finite state automata and transducers. In Finite State Methods in Natural Language Processing, Ankara, Turkey, 1998.","DOI":"10.3115\/1611533.1611538"},{"key":"1_CR4","unstructured":"P.C. Fishburn and P.L. Hammer. Bipartite dimensions and bipartite degrees of graphs. Technical Report 76, DIMACS, June 1993. available at \n                  http:\/\/dimacs.rutgers.edu\/TechnicalReports\n                  \n                ."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T. Jiang","year":"1993","unstructured":"Tao Jiang and B. Ravikumar. Minimal NFA Problems are hard. SIAM Journal of Computation, 22:1117\u20131141, December 1993.","journal-title":"SIAM Journal of Computation"},{"key":"1_CR6","unstructured":"J. Kim. State minimization of nondeterministic machines. Technical report, IBM Thomas J. Watson Res. Center, 1974. RC 4896."},{"issue":"19","key":"1_CR7","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1109\/T-C.1970.222994","volume":"C","author":"T. Kameda","year":"1970","unstructured":"T. Kameda and P. Weiner. On the state minimization of nondeterministic finite automata. IEEE Trans. Comp., C(19):617\u2013627, 1970.","journal-title":"IEEE Trans. Comp."},{"key":"1_CR8","unstructured":"U. Montanari. Networks of constraints: fundamental properties and applications to picture processing. Information Sciences, (7):95\u2013132, 1974."},{"key":"1_CR9","unstructured":"O. Matz and A. Potthoff. Computing small nondeterministic finite automata. In A. Skou U.H. Engberg, K.G. Larsen, editor, Workshop on Tools and Algorithms for the Construction and Analysis of Systems, pages 74\u201388. BRICS Notes Series, May 1995."},{"key":"1_CR10","first-page":"211","volume":"39","author":"J. Orlin","year":"1977","unstructured":"J. Orlin. Containment in graph theory: Covering graphs with cliques. Nederl. Akad. Wetensch. Indag. Math., 39:211\u2013218, 1977.","journal-title":"Nederl. Akad. Wetensch. Indag. Math."},{"key":"1_CR11","unstructured":"Dominique Revuz. Dictionnaires et Lexiques, m\u00e9thodes et algorithmes. PhD thesis, Universit\u00e9 Paris VII, F\u00e9vrier 1991."},{"key":"1_CR12","unstructured":"N. R. Vempaty. Solving constraint satisfaction problems using finite state automata. In American Association for Artificial Intelligence (AAAI\u201992), pages 453\u2013458, San Jose, 1992."}],"container-title":["Lecture Notes in Computer Science","Automata Implementation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45526-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T00:21:09Z","timestamp":1558484469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45526-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428121","9783540455264"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45526-4_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"16 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}