{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:12Z","timestamp":1725549192332},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243182"},{"type":"electronic","value":"9783540305002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_11","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:39:36Z","timestamp":1267461576000},"page":"113-124","source":"Crossref","is-referenced-by-count":3,"title":["Concatenation State Machines and Simple Functions"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Debski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Fraczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Korenjak, A.J., Hopcroft, J.E.: Simple deterministic languages. In: Proc. IEEE 7th Annual Symposium on Switching and Automata Theory. IEEE Symposium on Foundations of Computer Science, pp. 36\u201346 (1966)","DOI":"10.1109\/SWAT.1966.22"},{"key":"11_CR2","series-title":"Word Language Grammar","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-642-59136-5_3","volume-title":"Handbook of Formal Languages","author":"J.M. Autebert","year":"1997","unstructured":"Autebert, J.M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages. Word Language Grammar, vol.\u00a01, pp. 111\u2013174. Springer, Berlin (1997)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ipl.2003.10.006","volume":"89","author":"W. Fraczak","year":"2004","unstructured":"Fraczak, W., Podolak, A.: A characterization of s-languages. Information Processing Letters\u00a089, 65\u201370 (2004)","journal-title":"Information Processing Letters"},{"key":"11_CR4","volume-title":"Theory of Codes","author":"J. Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: Theory of Codes. Academic Press, London (1985)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(98)00115-7","volume":"234","author":"M. Mohri","year":"2000","unstructured":"Mohri, M.: Minimization algorithms for sequential transducers. Theoretical Computer Science\u00a0234, 177\u2013201 (2000)","journal-title":"Theoretical Computer Science"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Optimal Algorithms","author":"D. Caucal","year":"1989","unstructured":"Caucal, D.: A fast algorithm to decide on simple grammars equivalence. In: Djidjev, H.N. (ed.) Optimal Algorithms. LNCS, vol.\u00a0401. Springer, Heidelberg (1989)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-44977-9_8","volume-title":"Implementation and Application of Automata","author":"J. Czyzowicz","year":"2003","unstructured":"Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Prime decompositions of regular prefix codes. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 85\u201394. Springer, Heidelberg (2003)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1137\/0203006","volume":"3","author":"R. Tarjan","year":"1974","unstructured":"Tarjan, R.: Finding dominators in directed graphs. SIAM Journal on Computing\u00a03, 62\u201389 (1974)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR9","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A. Academic Press, London (1974)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner (1979)","DOI":"10.1007\/978-3-663-09367-1"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30500-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:07Z","timestamp":1605761827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30500-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}