{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:13:57Z","timestamp":1767928437887,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319035444","type":"print"},{"value":"9783319035451","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03545-1_6","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T16:31:48Z","timestamp":1386606708000},"page":"82-97","source":"Crossref","is-referenced-by-count":16,"title":["A Constructive Theory of Regular Languages in Coq"],"prefix":"10.1007","author":[{"given":"Christian","family":"Doczkal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan-Oliver","family":"Kaiser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gert","family":"Smolka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-32347-8_19","volume-title":"Interactive Theorem Proving","author":"A. Asperti","year":"2012","unstructured":"Asperti, A.: A compact proof of decidability for regular expression equivalence. In: Beringer, L., Felty, A. (eds.) ITP 2012. LNCS, vol.\u00a07406, pp. 283\u2013298. Springer, Heidelberg (2012)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Theorem Proving in Higher Order Logics","year":"2009","unstructured":"Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.): TPHOLs 2009. LNCS, vol.\u00a05674. Springer, Heidelberg (2009)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Berghofer, S., Reiter, M.: Formalizing the logic-automaton connection. In: Berghofer, et al. (eds.) [2], pp. 147\u2013163","DOI":"10.1007\/978-3-642-03359-9_12"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Braibant, T., Pous, D.: Deciding kleene algebras in coq. Logical Methods in Computer Science 8(1) (2012)","DOI":"10.2168\/LMCS-8(1:16)2012"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Constable, R.L., Jackson, P.B., Naumov, P., Uribe, J.C.: Constructively formalizing automata theory. In: Plotkin, G.D., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction, pp. 213\u2013238. The MIT Press (2000)","DOI":"10.7551\/mitpress\/5641.003.0014"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-25379-9_11","volume-title":"Certified Programs and Proofs","author":"T. Coquand","year":"2011","unstructured":"Coquand, T., Siles, V.: A decision procedure for regular expression equivalence in type theory. In: Jouannaud, J.-P., Shao, Z. (eds.) CPP 2011. LNCS, vol.\u00a07086, pp. 119\u2013134. Springer, Heidelberg (2011)"},{"key":"6_CR7","unstructured":"Doczkal, C., Kaiser, J.O., Smolka, G.: Formalization accompanying this paper, http:\/\/www.ps.uni-saarland.de\/extras\/cpp13\/"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Garillot, F., Gonthier, G., Mahboubi, A., Rideau, L.: Packaging mathematical structures. In: Berghofer, et al. (eds.) [2], pp. 327\u2013342","DOI":"10.1007\/978-3-642-03359-9_23"},{"key":"6_CR9","unstructured":"Gonthier, G., Mahboubi, A., Tassi, E.: A Small Scale Reflection Extension for the Coq system. Rapport de recherche RR-6455, INRIA (2008), http:\/\/hal.inria.fr\/inria-00258384"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation - international edition, 2nd edn. Addison-Wesley (2001)","DOI":"10.1145\/568438.568455"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0016-0032(54)90574-8","volume":"257","author":"D. Huffman","year":"1954","unstructured":"Huffman, D.: The synthesis of sequential switching circuits. Journal of the Franklin Institute\u00a0257(3), 161\u2013190 (1954)","journal-title":"Journal of the Franklin Institute"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, McCarthy (eds.) [19], pp. 3\u201342","DOI":"10.1515\/9781400882618-002"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Automata and computability. Undergraduate texts in computer science. Springer (1997)","DOI":"10.1007\/978-1-4612-1844-9"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10817-011-9223-4","volume":"49","author":"A. Krauss","year":"2012","unstructured":"Krauss, A., Nipkow, T.: Proof pearl: Regular expression equivalence and relation algebra. J. Autom. Reasoning\u00a049(1), 95\u2013106 (2012)","journal-title":"J. Autom. Reasoning"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. In: Shannon, McCarthy (eds.) [19], pp. 129\u2013153","DOI":"10.1515\/9781400882618-006"},{"key":"6_CR16","unstructured":"Myhill, J.R.: Finite Automata and the Representation of Events. Tech. Rep. WADC TR-57-624, Wright-Paterson Air Force Base (1957)"},{"issue":"4","key":"6_CR17","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proceedings of the American Mathematical Society\u00a09(4), 541\u2013544 (1958)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev.\u00a03(2), 114\u2013125 (1959)","journal-title":"IBM J. Res. Dev."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Shannon, C., McCarthy, J. (eds.): Automata Studies. Princeton University Press (1956)","DOI":"10.1515\/9781400882618"},{"key":"6_CR20","unstructured":"The Coq Development Team: http:\/\/coq.inria.fr"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-22863-6_25","volume-title":"Interactive Theorem Proving","author":"C. Wu","year":"2011","unstructured":"Wu, C., Zhang, X., Urban, C.: A formalisation of the Myhill-Nerode theorem based on regular expressions (Proof pearl). In: van Eekelen, M., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds.) ITP 2011. LNCS, vol.\u00a06898, pp. 341\u2013356. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Certified Programs and Proofs"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03545-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:44:59Z","timestamp":1716277499000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03545-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035444","9783319035451"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03545-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}