{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:47:26Z","timestamp":1725475646778},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354673"},{"type":"electronic","value":"9783540354697"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11780885_1","type":"book-chapter","created":{"date-parts":[[2006,12,11]],"date-time":"2006-12-11T17:13:38Z","timestamp":1165857218000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Characterizations of Regularity"],"prefix":"10.1007","author":[{"given":"Tero","family":"Harju","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Myhill, J.: Finite automata and the representation of events. Technical Report WADD TR-57-624, Wright Patterson Air Force Base, Ohio (1957)"},{"key":"1_CR2","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. Proc. Amer. Math. Soc.\u00a09, 541\u2013544 (1958)","journal-title":"Proc. Amer. Math. Soc."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"115","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 Journal\u00a03, 115\u2013125 (1959)","journal-title":"IBM Journal"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M.P. Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control\u00a08, 190\u2013194 (1965)","journal-title":"Inf. Control"},{"key":"#cr-split#-1_CR5.1","unstructured":"McNaughton, R., Papert, S.: Counter-free automata. The M.I.T. Press, Cambridge, Mass.-London (1971);"},{"key":"#cr-split#-1_CR5.2","unstructured":"With an appendix by William Henneman, M.I.T. Research Monograph, No. 65"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"C.C. Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc.\u00a098, 21\u201351 (1961)","journal-title":"Trans. Amer. Math. Soc."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(82)90072-5","volume":"4","author":"K. Culik II","year":"1982","unstructured":"Culik II, K., Fich, F., Salomaa, A.: A homomorphic characterization of regular languages. Discrete Appl. Math.\u00a04, 149\u2013152 (1982)","journal-title":"Discrete Appl. Math."},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/BFb0036926","volume-title":"Automata, Languages and Programming","author":"M. Latteux","year":"1983","unstructured":"Latteux, M., Leguy, J.: On the composition of morphisms and inverse morphisms. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 420\u2013432. Springer, Heidelberg (1983)"},{"key":"1_CR10","first-page":"162","volume":"20","author":"P. Turakainen","year":"1983","unstructured":"Turakainen, P.: A machine-oriented approach to composition of morphisms and inverse morphisms. Bulletin of the EATCS\u00a020, 162\u2013166 (1983)","journal-title":"Bulletin of the EATCS"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(83)90045-8","volume":"5","author":"J. Karhum\u00e4ki","year":"1983","unstructured":"Karhum\u00e4ki, J., Linna, M.: A note on morphic characterization of languages. Discrete Appl. Math.\u00a05, 243\u2013246 (1983)","journal-title":"Discrete Appl. Math."},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF01692069","volume":"20","author":"M. Latteux","year":"1987","unstructured":"Latteux, M., Turakainen, P.: A new normal form for the compositions of morphisms and inverse morphisms. Math. Systems Theory\u00a020, 261\u2013271 (1987)","journal-title":"Math. Systems Theory"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0166-218X(91)90096-F","volume":"32","author":"T. Harju","year":"1991","unstructured":"Harju, T., Kleijn, H.C.M.: Decidability problems for unary output sequential transducers. Discrete Appl. Math.\u00a032, 131\u2013140 (1991)","journal-title":"Discrete Appl. Math."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0166-218X(85)90063-0","volume":"12","author":"C. Choffrut","year":"1985","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Test sets for morphisms with bounded delay. Discrete Appl. Math.\u00a012, 93\u2013101 (1985)","journal-title":"Discrete Appl. Math."},{"key":"1_CR15","first-page":"224","volume":"86","author":"V. Halava","year":"2005","unstructured":"Halava, V., Harju, T., Latteux, M.: Representation of regular languages by equality sets. Bulletin of the EATCS\u00a086, 224\u2013228 (2005)","journal-title":"Bulletin of the EATCS"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.ipl.2005.01.014","volume":"94","author":"V. Halava","year":"2005","unstructured":"Halava, V., Harju, T., Latteux, M.: Equality sets of prefix morphisms and regular star languages. Inf. Process. Lett.\u00a094, 151\u2013154 (2005)","journal-title":"Inf. Process. Lett."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math.\u00a03 (1952)","DOI":"10.1112\/plms\/s3-2.1.326"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(82)90124-4","volume":"27","author":"A. Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On regularity of context-free languages. Theoret. Comput. Sci.\u00a027, 311\u2013332 (1983)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Finite-State Methods and Natural Language Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780885_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T21:05:28Z","timestamp":1555967128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780885_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354673","9783540354697"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11780885_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}