{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:49:20Z","timestamp":1725490160079},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404347"},{"type":"electronic","value":"9783540450078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45007-6_28","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T10:34:37Z","timestamp":1188297277000},"page":"349-360","source":"Crossref","is-referenced-by-count":2,"title":["On Deterministic Finite Automata and Syntactic Monoid Size, Continued"],"prefix":"10.1007","author":[{"given":"Markus","family":"Holzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"28_CR1","first-page":"50","volume":"1","author":"W. Feller","year":"1968","unstructured":"W. Feller. Stirling\u2019s formula. In An Introduction to Probability Theory and Its Applications, volume 1, chapter 2.9, pages 50\u201353. Wiley, 3rd edition, 1968.","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"28_CR2","unstructured":"G.H. Hardy and E.M. Wright. An Introduction to the Theory of Numbers. Clarendon, 5th edition, 1979."},{"key":"28_CR3","unstructured":"M. Holzer and B. K\u00f6nig. On deterministic finite automata and syntactic monoid size. In M. Ito and M. Toyama, editors, Preproceedings of the 6th International Conference on Developments in Language Theory, pages 229\u2013240, Kyoto, Japan, September 2002. Kyoto Sangyo University. To appear in LNCS."},{"key":"28_CR4","unstructured":"J.M. Howie. An Introduction to Semigroup Theory, volume 7 of L. M. S. Monographs. Academic Press, 1976."},{"key":"28_CR5","first-page":"92","volume":"3","author":"E. Landau","year":"1903","unstructured":"E. Landau. \u00dcber die Maximalordnung der Permutationen gegebenen Grades. Archiv der Mathematik und Physik, 3:92\u2013103, 1903.","journal-title":"Archiv der Mathematik und Physik"},{"key":"28_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.4064\/aa-14-3-315-332","volume":"14","author":"J.-L. Nicolas","year":"1968","unstructured":"J.-L. Nicolas. Sur l\u2019ordre maximum d\u2019un \u00e9l\u00e9ment dans le groupe s\n                           n des permutations. Acta Arithmetica, 14:315\u2013332, 1968.","journal-title":"Acta Arithmetica"},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.24033\/bsmf.1676","volume":"97","author":"J.-L. Nicolas","year":"1969","unstructured":"J.-L. Nicolas. Ordre maximum d\u2019un \u00e9l\u00e9ment du groupe de permutations et highly composite numbers. Bulletin of the Mathematical Society France, 97:129\u2013191, 1969.","journal-title":"Bulletin of the Mathematical Society France"},{"key":"28_CR8","volume-title":"Sur les bases du groupe sym\u00e9trique et les couples de substitutions qui engendrent un groupe r\u00e9gulier","author":"S. Piccard","year":"1946","unstructured":"S. Piccard. Sur les bases du groupe sym\u00e9trique et les couples de substitutions qui engendrent un groupe r\u00e9gulier. Librairie Vuibert, Paris, 1946."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"J.-E. Pin. Varieties of formal languages. North Oxford, 1986.","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/S0021-9800(68)80087-0","volume":"4","author":"R.C. Read","year":"1968","unstructured":"R.C. Read. An introduction to chromatic polynomials. Journal of Combinatorial Theory, 4:52\u201371, 1968.","journal-title":"Journal of Combinatorial Theory"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"26","DOI":"10.2307\/2308012","volume":"62","author":"H. Robbins","year":"1955","unstructured":"H. Robbins. A remark of Stirling\u2019s formula. American Mathematical Monthly, 62:26\u201329, 1955.","journal-title":"American Mathematical Monthly"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45007-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T22:58:48Z","timestamp":1550876328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45007-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404347","9783540450078"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45007-6_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}