no. 1
Fair expressions and regular languages over lists
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 1, pp. 15-66. 
@article{ITA_1997__31_1_15_0,
     author = {Breveglieri, L.},
     title = {Fair expressions and regular languages over lists},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {15--66},
     publisher = {EDP-Sciences},
     volume = {31},
     number = {1},
     year = {1997},
     mrnumber = {1460456},
     zbl = {0878.68077},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1997__31_1_15_0/}
}
TY  - JOUR
AU  - Breveglieri, L.
TI  - Fair expressions and regular languages over lists
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1997
SP  - 15
EP  - 66
VL  - 31
IS  - 1
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1997__31_1_15_0/
LA  - en
ID  - ITA_1997__31_1_15_0
ER  - 
%0 Journal Article
%A Breveglieri, L.
%T Fair expressions and regular languages over lists
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1997
%P 15-66
%V 31
%N 1
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1997__31_1_15_0/
%G en
%F ITA_1997__31_1_15_0
Breveglieri, L. Fair expressions and regular languages over lists. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 1, pp. 15-66. http://archive.numdam.org/item/ITA_1997__31_1_15_0/

[Ang80] D. Angluin, Finding Patterns common to a Set of Strings, in Journal of Computer and Systems Sciences, 1980, 21, pp. 63-86. | MR | Zbl

[Brg85] J. A. Bergstra and J. W. Klop, Algebra of communicating Process with Abstraction, in Theoretical Computer Science, 1985, 37, pp. 72-121. | MR | Zbl

[Bra88] F. Brandenburg, On the Intersections of Stacks and Queues, in Theoretical Computer Science, 1988, 58, pp. 69-80. | MR | Zbl

[Brs79] J. Berstel, Transduction and Context-free Languages, Teubner Studienbücher, Stuttgart, 1979. | MR | Zbl

[Bre94] L. Breveglieri, A. Cherubini and S. Crespi Reghizzi, 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.

[Bre93] L. Breveglieri, A. Cherubini, C. Citrini and S. Crespi Reghizzi, Fair Expressions, Round Robin Concurrency and Queue Automata, Internal Report n° 93-046, Dipartimento di Electronica e Informazione, Politecnico di Milano, Milano, 1993.

[Bre91] L. Breveglieri, A. Cherubini and S. Crespi Reghizzi, Quasi-Real-Time Scheduling by Queue Automata, in Lecture Notes in Computer Science, J. VYTOPIL Ed., Springer-Verlag, 1991, 571, pp. 131-147.

[Che91] A. Cherubini, C. Citrini, S. Crespi Reghizzi and D. Mandrioli, QRT FIFO Automata, Breadth-first Grammars and their Relations, in Theoretical Computer Science, 1991, 85, pp. 171-203. | MR | Zbl

[Eil74] S. Eilenberg, Automata, Languages and Machines, vol. A, Academic Press, 1974. | MR | Zbl

[Fra80] P. Franchi Zannettacci and B. Vauquelin, Automates à File, in French, Queue Automata, in Theoretical Computer Science, 1980, 11, pp. 221-225. | MR | Zbl

[Fri94] M. Frigerio, Espressioni Fair, Processi paralleli e Automi a Coda, in Italian, Fair Expressions, parallel Processes and Queue Automata, Thesis, Università degli Studi di Milano, Faculty of Information Sciences, Milano, Italy, 1994-1995.

[Gar92] V. K. Garg and M. T. Ragunath, Concurrent regular Expressions and their Relationship to Petri Nets, in Theoretical Computer Science, 1992, 96, pp. 285-304 | MR | Zbl