{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:38Z","timestamp":1725662918750},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540074076"},{"type":"electronic","value":"9783540379232"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07407-4_2","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:56:41Z","timestamp":1330185401000},"page":"16-19","source":"Crossref","is-referenced-by-count":2,"title":["Le cylindre des langages lineaires n'est pas principal"],"prefix":"10.1007","author":[{"given":"L.","family":"Boasson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Nivat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"2_CR1","first-page":"180","volume":"2","author":"L. Boasson","year":"1973","unstructured":"BOASSON L. et M. NIVAT: Sur Diverses Familles de Langages Ferm\u00e9es par Transductions Rationnelles. Acta Informatica, 2, 180\u2013188 (1973).","journal-title":"Acta Informatica"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"GINSBURG S.: The Mathematical Theory of Context-Free Languages. Mc Graw Hill (1966).","DOI":"10.1145\/321312.321318"},{"key":"2_CR3","unstructured":"GREIBACH S.: Jump pda's, Deterministic Context-Free Languages, Principal AFDL's and Polynomial Time Recognition. Proc. of 5th Annual ACM Symposium on Theory of Computing, Austin, (Texas), 20\u201328 (1973)."},{"issue":"no 4","key":"2_CR4","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/0202025","volume":"2","author":"S. Greibach","year":"1975","unstructured":"GREIBACH S.: The Hardest Context-Free Language. Siam J. of Comput., 2, no4, 304\u2013330 (1975).","journal-title":"Siam J. of Comput."}],"container-title":["Lecture Notes in Computer Science","Automata Theory and Formal Languages 2nd GI Conference Kaiserslautern, May 20\u201323, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07407-4_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:57:34Z","timestamp":1605643054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07407-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540074076","9783540379232"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-07407-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}