{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:46:35Z","timestamp":1725493595158},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405610"},{"type":"electronic","value":"9783540450894"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45089-0_21","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T03:27:35Z","timestamp":1193455655000},"page":"226-238","source":"Crossref","is-referenced-by-count":0,"title":["Weak Minimization of DFA \u2014 An Algorithm and Applications"],"prefix":"10.1007","author":[{"given":"Bala","family":"Ravikumar","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"D. Coppersmith and S. Winograd: Matrix Multiplication via Arithmetic Progressions. Journal of Symbolic Computation 9(3): 251\u2013280 (1990).","journal-title":"Journal of Symbolic Computation"},{"key":"21_CR2","unstructured":"M. Garey and D. Johnson, Computers and Intractability-A Guide to the Theory of NP-completeness, W.H. Freeman & Sons (1979)."},{"key":"21_CR3","unstructured":"J. Hopcroft and J. Ullman, Introduction to Automata, Languages and Theory of Computation, Addison-Wesley, Inc. (1979)."},{"issue":"6","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T. Jiang","year":"1993","unstructured":"T. Jiang and B. Ravikumar, Minimal NFA problems are hard, SIAM Journal on Computing Vol. 22, No. 6, 1117\u20131141, (1993).","journal-title":"SIAM Journal on Computing"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0012-365X(80)90098-9","volume":"32","author":"D. Klarner","year":"1980","unstructured":"D. Klarner and J. Pollack, Domino tilings with rectangles of fixed width, Discrete Mathematics 32 (1980), 45\u201352.","journal-title":"Discrete Mathematics"},{"key":"21_CR6","volume-title":"Introduction to Combinatorial Mathematics","author":"C. L. Liu","year":"1968","unstructured":"C. L. Liu, Introduction to Combinatorial Mathematics, McGraw Hill, New York, NY, 1968."},{"key":"21_CR7","volume-title":"The Self-avoiding walk","author":"N. Madras","year":"1993","unstructured":"N. Madras and G. Slade, The Self-avoiding walk, Birkhauser, Boston, MA, 1993."},{"key":"21_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/3-540-44683-4_51","volume-title":"Mathematical Foundations of Computer Science","author":"M. Ogihara","year":"2001","unstructured":"M. Ogihara and S. Toda, The complexity of computing the number of selfavoiding walks, Mathematical Foundations of Computer Science 2001, Editors: J. Sgall et al., Springer-Verlag Lecture Notes in Computer Science, Vol. 2136, 585\u2013597."},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"#R29","DOI":"10.37236\/1314","volume":"4","author":"L. Pachter","year":"1997","unstructured":"L. Pachter, Combinatorial Approaches and Conjectures for 2-Divisibility Problems Concerning Domino Tilings of Polyominoes, Electronic Journal of Combinatorics 4 (1997), #R29.","journal-title":"Electronic Journal of Combinatorics"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"A. Ponitz and P. Tittmann, Improved Upper Bounds for Self-Avoiding Walks in Zd, Electronic Journal of Combinatorics 7 (2000), # R 21.","DOI":"10.37236\/1499"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"J. Propp, A reciprocity theorem for domino tilings, Electronic Journal of Combinatorics 8 (2001), # R 18.","DOI":"10.37236\/1562"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0166-218X(85)90042-3","volume":"12","author":"R. Stanley","year":"1985","unstructured":"R. Stanley, On dimer coverings of rectangles of fixed width, Discrete Applied Mathematics 12 (1985), 81\u201387.","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"R. Stearns","year":"1985","unstructured":"R. Stearns and H. Hunt, On the quivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata, SIAM Journal on Computing 14 (1985), 598\u2013611.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"21_CR14","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L. Valiant","year":"1979","unstructured":"L. Valiant, The complexity of enumeration and reliability problems, SIAM Journal on Computing, 8(3): 410\u2013421, 1979.","journal-title":"SIAM Journal on Computing"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"H. Wilf, The problem of kings, Electronic Journal of Combinatorics. 2 (1995), #R3.","DOI":"10.37236\/1197"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45089-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T13:09:26Z","timestamp":1587992966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45089-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405610","9783540450894"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45089-0_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}