{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:37Z","timestamp":1725663217576},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540156413"},{"type":"electronic","value":"9783540395058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15641-0_24","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:20:07Z","timestamp":1330194007000},"page":"68-80","source":"Crossref","is-referenced-by-count":1,"title":["A formal proof system for infinitary rational expressions"],"prefix":"10.1007","author":[{"given":"Ph.","family":"Darondeau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Kott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"6_CR1","unstructured":"A. Arnold, M. Nivat, \"Comportements de processus\" in Colloque AFCET \"Les Math\u00e9matiques de l'Informatique\", pp. 35\u201368, Paris (1982)."},{"key":"6_CR2","unstructured":"J. B\u00fcchi, \"On a decision method in restricted second order arithmetics\", Int. Cong. of Logic, Method. Phil. Science, Stanford Univ.Press (1962)."},{"key":"6_CR3","unstructured":"Ph. Darondeau, L. Kott, \"On the observational semantics of fair parallelism\", 10th ICALP, Barcelona (1983), LNCS 154 pp. 147\u2013159."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Ph. Darondeau, L. Kott, \"Towards a formal proof system for \u03c9-rational expressions\", to appear in Inform. Proc. Letter (1984).","DOI":"10.1016\/0020-0190(84)90079-6"},{"key":"6_CR5","volume-title":"\"Automata, Languages and Machines\" Vol. A","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg, \"Automata, Languages and Machines\" Vol. A, Academic Press, New-York (1974)."},{"key":"6_CR6","unstructured":"H. Izumi, Y. Inagaki, N. Honda, \"A complete axiom system for algebra of closed-regular expressions\", 11th ICALP, Antwerp (1984), LNCS 17 pp.260\u2013269."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"P. Lauer, P. Torrigliani, W. Shields, \"COSY, a specification language based on paths and processes\", Acta Informatica, 12.","DOI":"10.1007\/BF00266047"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. Mac Naughton","year":"1966","unstructured":"R. Mac Naughton, \"Testing and generating infinite sequences by a finite automaton\", Information and Control 9, pp. 521\u2013530 (1966).","journal-title":"Information and Control"},{"key":"6_CR9","volume-title":"Theory of Automata","author":"A. Salomaa","year":"1969","unstructured":"A. Salomaa, \"Theory of Automata\", Pergamon Press, Oxford (1969)."}],"container-title":["Lecture Notes in Computer Science","Automata on Infinite Words"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15641-0_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:08:28Z","timestamp":1605643708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15641-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540156413","9783540395058"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-15641-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}