{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:33Z","timestamp":1725558933255},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141614"},{"type":"electronic","value":"9783642141621"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14162-1_6","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:21Z","timestamp":1278321981000},"page":"64-75","source":"Crossref","is-referenced-by-count":5,"title":["Pumping and Counting on the Regular Post Embedding Problem"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Chambart","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Schnoebelen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"6_CR1","first-page":"419","volume":"89","author":"P.A. Abdulla","year":"2008","unstructured":"Abdulla, P.A., Deneux, J., Ouaknine, J., Quaas, K., Worrell, J.: Universality analysis for one-clock timed automata. Fundamenta Informaticae\u00a089(4), 419\u2013450 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-77050-3_22","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"P. Chambart","year":"2007","unstructured":"Chambart, P., Schnoebelen, P.: Post embedding problem is not primitive recursive, with applications to channel systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 265\u2013276. Springer, Heidelberg (2007)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-78499-9_8","volume-title":"Foundations of Software Science and Computational Structures","author":"P. Chambart","year":"2008","unstructured":"Chambart, P., Schnoebelen, P.: The \u03c9-regular Post embedding problem. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 97\u2013111. Springer, Heidelberg (2008)"},{"key":"6_CR4","first-page":"205","volume-title":"Proc. LICS 2008","author":"P. Chambart","year":"2008","unstructured":"Chambart, P., Schnoebelen, P.: The ordinal recursive complexity of lossy channel systems. In: Proc. LICS 2008, pp. 205\u2013216. IEEE Comp. Soc. Press, Los Alamitos (2008)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. DLT 2010","author":"P. Chambart","year":"2010","unstructured":"Chambart, P., Schnoebelen, P.: Computing blocker sets for the Regular Post Embedding Problem. In: Proc. DLT 2010. LNCS. Springer, Heidelberg (2010) (to appear)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-642-12032-9_17","volume-title":"Proc. FOSSACS 2010","author":"P. Chambart","year":"2010","unstructured":"Chambart, P., Schnoebelen, P.: Toward a compositional theory of leftist grammars and transformations. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 237\u2013251. Springer, Heidelberg (2010)"},{"issue":"1-2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(97)00009-1","volume":"201","author":"E.A. Cichon","year":"1998","unstructured":"Cichon, E.A., Tahhan Bittar, E.: Ordinal recursive bounds for Higman\u2019s theorem. Theoretical Computer Science\u00a0201(1-2), 63\u201384 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.apal.2006.01.001","volume":"142","author":"D. Gabelaia","year":"2006","unstructured":"Gabelaia, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Non-primitive recursive decidability of products of modal logics with expanding domains. Annals of Pure and Applied Logic\u00a0142(1-3), 245\u2013268 (2006)","journal-title":"Annals of Pure and Applied Logic"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-70583-3_5","volume-title":"Automata, Languages and Programming","author":"T. Jurdzi\u0144ski","year":"2008","unstructured":"Jurdzi\u0144ski, T.: Leftist grammars are nonprimitive recursive. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 51\u201362. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. ACM Trans. Computational Logic\u00a09(2) (2008)","key":"6_CR10","DOI":"10.1145\/1342991.1342994"},{"issue":"3","key":"6_CR11","first-page":"251","volume":"88","author":"R. Lazi\u0107","year":"2008","unstructured":"Lazi\u0107, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fundamenta Informaticae\u00a088(3), 251\u2013274 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"6_CR12","series-title":"Encyclopedia of Mathematics and Its Applications","volume-title":"Combinatorics on words","year":"1983","unstructured":"Lothaire, M. (ed.): Combinatorics on words. Encyclopedia of Mathematics and Its Applications, vol.\u00a017. Cambridge Univ. Press, Cambridge (1983)"},{"key":"6_CR13","series-title":"Encyclopedia of Mathematics and Its Applications","volume-title":"Algebraic combinatorics on words","year":"2002","unstructured":"Lothaire, M. (ed.): Algebraic combinatorics on words. Encyclopedia of Mathematics and Its Applications, vol.\u00a090. Cambridge Univ. Press, Cambridge (2002)"},{"issue":"1","key":"6_CR14","first-page":"1","volume":"3","author":"J. Ouaknine","year":"2007","unstructured":"Ouaknine, J., Worrell, J.: On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Comp. Science\u00a03(1), 1\u201327 (2007)","journal-title":"Logical Methods in Comp. Science"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14162-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:38:08Z","timestamp":1558294688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}