{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T02:39:05Z","timestamp":1794364745991,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642029783","type":"print"},{"value":"9783642029790","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02979-0_21","type":"book-chapter","created":{"date-parts":[[2009,7,6]],"date-time":"2009-07-06T08:16:20Z","timestamp":1246868180000},"page":"178-187","source":"Crossref","is-referenced-by-count":3,"title":["Implementation of State Elimination Using Heuristics"],"prefix":"10.1007","author":[{"given":"Jae-Hee","family":"Ahn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/inco.1997.2688","volume":"140","author":"A. Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Information and Computation\u00a0140, 229\u2013253 (1998)","journal-title":"Information and Computation"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/PGEC.1963.263416","volume":"12","author":"J. Brzozowski","year":"1963","unstructured":"Brzozowski, J., McCluskey Jr., E.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Transactions on Electronic Computers\u00a0EC-12, 67\u201376 (1963)","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-540-30500-2_31","volume-title":"Implementation and Application of Automata","author":"M. Delgado","year":"2005","unstructured":"Delgado, M., Morais, J.: Approximation to the smallest regular expression for a given regular language. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 312\u2013314. Springer, Heidelberg (2005)"},{"key":"21_CR4","first-page":"233","volume":"9","author":"K. Ellul","year":"2004","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.-W.: Regular expressions: New results and open problems. Journal of Automata, Languages and Combinatorics\u00a09, 233\u2013256 (2004)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"V. Glushkov","year":"1961","unstructured":"Glushkov, V.: The abstract theory of automata. Russian Mathematical Surveys\u00a016, 1\u201353 (1961)","journal-title":"Russian Mathematical Surveys"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-540-85780-8_30","volume-title":"Developments in Language Theory","author":"H. Gruber","year":"2008","unstructured":"Gruber, H., Holzer, M.: Provably shorter regular expressions from deterministic finite automata. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 383\u2013395. Springer, Heidelberg (2008)"},{"key":"21_CR7","unstructured":"Gulan, S., Fernau, H.: Local elimination-strategies in automata for shorter regular expressions. In: Proceedings of SOFSEM 2008, pp. 46\u201357 (2008)"},{"issue":"1-3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.tcs.2006.09.025","volume":"370","author":"Y.-S. Han","year":"2007","unstructured":"Han, Y.-S., Wood, D.: Obtaining shorter regular expressions from finite-state automata. Theoretical Computer Science\u00a0370(1-3), 110\u2013120 (2007)","journal-title":"Theoretical Computer Science"},{"key":"21_CR9","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"},{"issue":"6","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T. Jiang","year":"1993","unstructured":"Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM Journal on Computing\u00a022(6), 1117\u20131141 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR11","first-page":"3","volume-title":"Automata Studies","author":"S. Kleene","year":"1956","unstructured":"Kleene, S.: Representation of events in nerve nets and finite automata. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp. 3\u201342. Princeton University Press, Princeton (1956)"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"9","author":"R. McNaughton","year":"1960","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers\u00a09, 39\u201347 (1960)","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Meyer, A., Stockmeyer, L.: The equivalence problem for regular expressions with squaring requires exponential time. In: Proceedings of the Thirteenth Annual IEEE Symposium on Switching and Automata Theory, pp. 125\u2013129 (1972)","DOI":"10.1109\/SWAT.1972.29"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Moreira, N., Reis, R.: Series-parallel automata and short regular expressions. Fundamenta Informaticae (accepted for publication, 2009)","DOI":"10.3233\/FI-2009-0061"},{"key":"21_CR15","unstructured":"Rodger, S.H., Finley, T.W.: JFLAP: An Interactive Formal Languages and Automata Package. Jones & Bartlett Pub. (2006)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Communications of the ACM\u00a011, 419\u2013422 (1968)","journal-title":"Communications of the ACM"},{"key":"21_CR17","volume-title":"Theory of Computation","author":"D. Wood","year":"1987","unstructured":"Wood, D.: Theory of Computation. John Wiley & Sons, Inc., New York (1987)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02979-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T04:09:53Z","timestamp":1589947793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02979-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029783","9783642029790"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02979-0_21","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-02979-0","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}