{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:07Z","timestamp":1725456727045},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540508406"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029007","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:28:19Z","timestamp":1133414899000},"page":"458-467","source":"Crossref","is-referenced-by-count":2,"title":["New results on the generalized star-height problem"],"prefix":"10.1007","author":[{"given":"J. E.","family":"Pin","sequence":"first","affiliation":[]},{"given":"H.","family":"Straubing","sequence":"additional","affiliation":[]},{"given":"D.","family":"Th\u00e9rien","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/B978-0-12-115350-2.50007-5","volume-title":"Formal language theory, perspectives and open problems","author":"J. A. Brzozowski","year":"1980","unstructured":"J. A. Brzozowski, Open problems about regular languages, Formal language theory, perspectives and open problems (R.V. Book editor), Academic Press, New York, 1980, 23\u201347."},{"key":"39_CR2","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg, Automata, Languages and Machines, Academic Press, New York, Vol. A, 1974; Vol B, 1976."},{"key":"39_CR3","unstructured":"W.H. Henneman, Algebraic theory of automata, Ph. D. Dissertation, MIT (1971)."},{"key":"39_CR4","volume-title":"Semigroups and Combinatorial Applications","author":"G. Lallement","year":"1979","unstructured":"G. Lallement, Semigroups and Combinatorial Applications, Wiley, New York, 1979."},{"key":"39_CR5","series-title":"Encyclopedia of Mathematics","volume-title":"Combinatorics on words","author":"M. Lothaire","year":"1983","unstructured":"M. Lothaire, Combinatorics on words, Encyclopedia of Mathematics 17, Addison-Wesley, Reading, MA, 1983."},{"key":"39_CR6","volume-title":"Counter-free Automata","author":"R. McNaughton","year":"1971","unstructured":"R. McNaughton and S. Papert, Counter-free Automata, MIT-Press, Cambridge, Mass., 1971."},{"key":"39_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of formal languages","author":"J.E. Pin","year":"1986","unstructured":"J.E. Pin, Varieties of formal languages, North Oxford Academic, London and Plenum, New York, 1986."},{"key":"39_CR8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M.P. Sch\u00fctzenberger","year":"1965","unstructured":"M.P. Sch\u00fctzenberger, On finite monoids having only trivial subgroups, Information and Control, 8 (1965), 190\u2013194.","journal-title":"Information and Control"},{"key":"39_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0019-9958(85)80058-9","volume":"66","author":"J. Stern","year":"1985","unstructured":"J. Stern, Complexity of some problems from the theory of automata, Information and Control 66 (1985), 163\u2013176.","journal-title":"Information and Control"},{"key":"39_CR10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0022-4049(79)90025-2","volume":"15","author":"H. Straubing","year":"1979","unstructured":"H. Straubing, Aperiodic homomorphisms and the concatenation product of recognizable sets, J. Pure Appl. Algebra, 15 (1979) 319\u2013327.","journal-title":"J. Pure Appl. Algebra"},{"key":"39_CR11","unstructured":"D. Th\u00e9rien, Classification of regular languages by congruences, Ph. D. Thesis, Waterloo, 1980."},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"D. Th\u00e9rien, Subwords counting and nilpotent groups, in Combinatorics on Words, Progress and Perspectives, L. Cummings ed., Academic Press (1983), 293\u2013306.","DOI":"10.1016\/B978-0-12-198820-3.50021-8"},{"key":"39_CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(81)90041-4","volume":"13","author":"W. Thomas","year":"1981","unstructured":"W. Thomas, Remark on the Star-Height Problem, Theoretical Computer Science 13, 1981, 231\u2013237.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","STACS 89"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029007.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:59:33Z","timestamp":1607551173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540508406"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0029007","relation":{},"subject":[]}}