{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T15:21:42Z","timestamp":1648912902220},"reference-count":12,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1997]]},"DOI":"10.1051\/ita\/1997310100151","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T09:59:07Z","timestamp":1486029547000},"page":"15-66","source":"Crossref","is-referenced-by-count":1,"title":["Fair expressions and regular languages over lists"],"prefix":"10.1051","volume":"31","author":[{"given":"L.","family":"Breveglieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"[Ang80] ANGLUIN D., Finding Patterns common to a Set of Strings, in Journal of Computer and Systems Sciences, 1980, 21, pp. 63-86.5898030454.68108","DOI":"10.1016\/0022-0000(80)90041-0"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"[Brg85] BERGSTRA J. A. and KLOP J. W., Algebra of communicating Process with Abstraction, in Theoretical Computer Science, 1985, 37, pp. 72-121.7963140579.68016","DOI":"10.1016\/0304-3975(85)90088-X"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"[Bra88] BRANDENBURG F., On the Intersections of Stacks and Queues, in Theoretical Computer Science, 1988, 58, pp. 69-80.9632550677.68088","DOI":"10.1016\/0304-3975(88)90019-9"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"[Brs79] BERSTEL J., Transduction and Context-free Languages, Teubner Studienb\u00fccher, Stuttgart, 1979.5494810424.68040","DOI":"10.1007\/978-3-663-09367-1"},{"key":"R5","unstructured":"[Bre94] BREVEGLIERI L., CHERUBINI A. and CRESPI REGHIZZI S., Fair List Languages and parallel Programme Schemes, in Developments in Formal Language Theory, G. ROZENBERG and A. SALOMAA Eds., World Scientific Publishing, 1994, pp. 389-418."},{"key":"R6","unstructured":"[Bre93] BREVEGLIERI L., CHERUBINI A., CITRINI C. and CRESPI REGHIZZI S., Fair Expressions, Round Robin Concurrency and Queue Automata, Internal Report n\u00b0 93-046, Dipartimento di Electronica e Informazione, Politecnico di Milano, Milano, 1993."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"[Bre91] BREVEGLIERI L., CHERUBINI A. and CRESPI REGHIZZI S., Quasi-Real-Time Scheduling by Queue Automata, in Lecture Notes in Computer Science, J. VYTOPIL Ed., Springer-Verlag, 1991, 571, pp. 131-147.","DOI":"10.1007\/3-540-55092-5_8"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"[Che91] CHERUBINI A., CITRINI C., CRESPI REGHIZZI S. and MANDRIOLI D., QRT FIFO Automata, Breadth-first Grammars and their Relations, in Theoretical Computer Science, 1991, 85, pp. 171-203.11181350745.68069","DOI":"10.1016\/0304-3975(91)90053-5"},{"key":"R9","unstructured":"[Eil74] EILENBERG S., Automata, Languages and Machines, vol. A, Academic Press, 1974.5303820317.94045"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"[Fra80] FRANCHI ZANNETTACCI P. and VAUQUELIN B., Automates \u00e0 File, in French, Queue Automata, in Theoretical Computer Science, 1980, 11, pp. 221-225.5722170434.68062","DOI":"10.1016\/0304-3975(80)90047-X"},{"key":"R11","unstructured":"[Fri94] FRIGERIO M., Espressioni Fair, Processi paralleli e Automi a Coda, in Italian, Fair Expressions, parallel Processes and Queue Automata, Thesis, Universit\u00e0 degli Studi di Milano, Faculty of Information Sciences, Milano, Italy, 1994-1995."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"[Gar92] GARG V. K. and RAGUNATH M. T., Concurrent regular Expressions and their Relationship to Petri Nets, in Theoretical Computer Science, 1992, 96, pp. 285-30411605470745.68080","DOI":"10.1016\/0304-3975(92)90339-H"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1997310100151\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:56:30Z","timestamp":1568771790000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1997310100151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":12,"journal-issue":{"issue":"1"},"alternative-id":["ita1997310100151"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1997310100151","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}