{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:43Z","timestamp":1725543463708},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354284"},{"type":"electronic","value":"9783540354307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_8","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T01:55:49Z","timestamp":1150854949000},"page":"71-82","source":"Crossref","is-referenced-by-count":1,"title":["Equivalence of Functions Represented by Simple Context-Free Grammars with Output"],"prefix":"10.1007","author":[{"given":"C\u00e9dric","family":"Bastien","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jurek","family":"Czyzowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Fraczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11605157_7","volume-title":"Implementation and Application of Automata","author":"C. Bastien","year":"2006","unstructured":"Bastien, C., Czyzowicz, J., Fraczak, W., Rytter, W.: Prime normal form and equivalence of simple grammars. In: Farr\u00e9, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol.\u00a03845, pp. 78\u201389. Springer, Heidelberg (2006)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-51859-2_8","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, pp. 66\u201385. Springer, Heidelberg (1989)"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01744577","volume":"16","author":"B. Courcelle","year":"1983","unstructured":"Courcelle, B.: An axiomatic approach to the Korenjak-Hopcroft algorithms. Mathematical Systems Theory\u00a016(3), 191\u2013231 (1983)","journal-title":"Mathematical Systems Theory"},{"key":"8_CR4","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, New York (1994)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-30500-2_11","volume-title":"Implementation and Application of Automata","author":"W. Debski","year":"2005","unstructured":"Debski, W., Fraczak, W.: Concatenation state machines and simple functions. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 113\u2013124. Springer, Heidelberg (2005)"},{"key":"8_CR6","volume-title":"Introduction to formal language theory","author":"M.A. Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to formal language theory. Addison-Wesley, Reading (1978)"},{"issue":"1\u20132","key":"8_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(95)00064-X","volume":"158","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science\u00a0158(1\u20132), 143\u2013159 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0020-0190(81)90116-2","volume":"13","author":"O.H. Ibarra","year":"1981","unstructured":"Ibarra, O.H., Rosier, L.E.: On the decidability of equivalence of deterministic pushdown transducers. Information Processing Letters\u00a013(3), 89\u201393 (1981)","journal-title":"Information Processing Letters"},{"key":"8_CR9","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":"8_CR10","doi-asserted-by":"crossref","unstructured":"Lothaire: Combinatorics on words. Cambridge University Press, United Kingdom (1997)","DOI":"10.1017\/CBO9780511566097"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/3-540-48523-6_63","volume-title":"Automata, Languages and Programming","author":"G. S\u00e9nizergues","year":"1999","unstructured":"S\u00e9nizergues, G.: T(A) = T(B)? In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 665\u2013675. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:15:59Z","timestamp":1619493359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11779148_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}