{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T11:38:39Z","timestamp":1794569919576,"version":"4.9.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319946306","type":"print"},{"value":"9783319946313","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94631-3_17","type":"book-chapter","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T02:09:52Z","timestamp":1531188592000},"page":"200-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cycle Height of Finite Automata"],"prefix":"10.1007","author":[{"given":"Chris","family":"Keeler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.jspi.2005.02.004","volume":"135","author":"C Banderier","year":"2004","unstructured":"Banderier, C., Schwer, S.R.: Why Delannoy numbers? J. Statist. Plann. Inference 135, 40\u201354 (2004)","journal-title":"J. Statist. Plann. Inference"},{"key":"17_CR2","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1142\/S0129054110007441","volume":"21","author":"P Gawrychowski","year":"2010","unstructured":"Gawrychowski, P., Krieger, D., Rampersad, N., Shallit, J.: Finding the growth rate of a regular or context-free language in polynomial time. Int. J. Found. Comput. Sci. 21(4), 597\u2013618 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"17_CR4","first-page":"193","volume":"8","author":"J Goldstine","year":"2002","unstructured":"Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. Univ. Comput. Sci. 8(2), 193\u2013234 (2002)","journal-title":"J. Univ. Comput. Sci."},{"issue":"2","key":"17_CR5","first-page":"189","volume":"14","author":"H Gruber","year":"2012","unstructured":"Gruber, H.: Digraph complexity measures and applications in formal language theory. Discrete Math. Theor. Comput. Sci. 14(2), 189\u2013204 (2012)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"8","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1142\/S0129054115400110","volume":"26","author":"H Gruber","year":"2015","unstructured":"Gruber, H., Holzer, M.: From finite automata to regular expressions and back - a summary on descriptional complexity. Int. J. Found. Comput. Sci. 26(8), 1009\u20131040 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.14232\/actacyb.23.1.2017.9","volume":"23","author":"Y-S Han","year":"2017","unstructured":"Han, Y.-S., Salomaa, A., Salomaa, K.: Ambiguity, nondeterminism and state complexity of finite automata. Acta Cybernetica 23, 141\u2013157 (2017)","journal-title":"Acta Cybernetica"},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.ic.2010.11.013","volume":"209","author":"M Holzer","year":"2011","unstructured":"Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata - a survey. Inform. Comput. 209(3), 456\u2013470 (2011)","journal-title":"Inform. Comput."},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-60252-3_16","volume-title":"Descriptional Complexity of Formal Systems","author":"C Keeler","year":"2017","unstructured":"Keeler, C., Salomaa, K.: Branching measures and nearly acyclic NFAs. In: Pighizzini, G., C\u00e2mpeanu, C. (eds.) DCFS 2017. LNCS, vol. 10316, pp. 202\u2013213. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60252-3_16"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Kutrib, M., Pighizzini, G.: Recent trends in descriptional complexity of formal languages. Bull. EATCS (111) (2013)","DOI":"10.1007\/978-3-642-31623-4"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-319-04298-5_37","volume-title":"SOFSEM 2014: Theory and Practice of Computer Science","author":"M Kutrib","year":"2014","unstructured":"Kutrib, M., Meckel, K., Wendlandt, M.: Parameterized prefix distance between regular languages. In: Geffert, V., Preneel, B., Rovan, B., \u0160tuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 419\u2013430. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04298-5_37"},{"key":"17_CR12","unstructured":"Msiska, M., van Zijl, L.: Interpreting the subset construction using finite sublanguages. In: Proceedings of Prague Stringology Conference 2016, pp. 48\u201362 (2016)"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"RK Ahuja","year":"1990","unstructured":"Ahuja, R.K., Mehlhorn, K., Orlin, J.B., Tarjan, R.E.: Faster algorithms for the shortest path problem. J. ACM 37(2), 213\u2013223 (1990)","journal-title":"J. ACM"},{"key":"17_CR14","volume-title":"Second Course in Formal Languages and Automata Theory","author":"J Shallit","year":"2009","unstructured":"Shallit, J.: Second Course in Formal Languages and Automata Theory. Cambridge University Press, New York (2009)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/3-540-55808-X_48","volume-title":"Mathematical Foundations of Computer Science 1992","author":"A Szilard","year":"1992","unstructured":"Szilard, A., Yu, S., Zhang, K., Shallit, J.: Characterizing regular languages with polynomial densities. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 494\u2013503. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55808-X_48"},{"issue":"2","key":"17_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Tattersall, J.J.: Elementary Number Theory in Nine Chapters, Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511756344"},{"issue":"2","key":"17_CR18","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1080\/00150517.1975.12430664","volume":"13","author":"CK Wong","year":"1975","unstructured":"Wong, C.K., Maddocks, T.W.: A generalized Pascal\u2019s triangle. Fibonacci Quart. 13(2), 134\u2013136 (1975)","journal-title":"Fibonacci Quart."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94631-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T13:37:36Z","timestamp":1751722656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94631-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946306","9783319946313"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94631-3_17","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-94631-3","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"11 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Halifax, NS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.smu.ca\/~dcfs2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}