Fair expressions and regular languages over lists

L. Breveglieri

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1997)

  • Volume: 31, Issue: 1, page 15-66
  • ISSN: 0988-3754

How to cite

top

Breveglieri, L.. "Fair expressions and regular languages over lists." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 31.1 (1997): 15-66. <http://eudml.org/doc/92552>.

@article{Breveglieri1997,
author = {Breveglieri, L.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {Chomsky hierarchy},
language = {eng},
number = {1},
pages = {15-66},
publisher = {EDP-Sciences},
title = {Fair expressions and regular languages over lists},
url = {http://eudml.org/doc/92552},
volume = {31},
year = {1997},
}

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
PB - EDP-Sciences
VL - 31
IS - 1
SP - 15
EP - 66
LA - eng
KW - Chomsky hierarchy
UR - http://eudml.org/doc/92552
ER -

References

top
  1. [Ang80] D. ANGLUIN, Finding Patterns common to a Set of Strings, in Journal of Computer and Systems Sciences, 1980, 21, pp. 63-86. Zbl0454.68108MR589803
  2. [Brg85] J. A. BERGSTRA and J. W. KLOP, Algebra of communicating Process with Abstraction, in Theoretical Computer Science, 1985, 37, pp. 72-121. Zbl0579.68016MR796314
  3. [Bra88] F. BRANDENBURG, On the Intersections of Stacks and Queues, in Theoretical Computer Science, 1988, 58, pp. 69-80. Zbl0677.68088MR963255
  4. [Brs79] J. BERSTEL, Transduction and Context-free Languages, Teubner Studienbücher, Stuttgart, 1979. Zbl0424.68040MR549481
  5. [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. 
  6. [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. 
  7. [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. 
  8. [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. Zbl0745.68069MR1118135
  9. [Eil74] S. EILENBERG, Automata, Languages and Machines, vol. A, Academic Press, 1974. Zbl0317.94045MR530382
  10. [Fra80] P. FRANCHI ZANNETTACCI and B. VAUQUELIN, Automates à File, in French, Queue Automata, in Theoretical Computer Science, 1980, 11, pp. 221-225. Zbl0434.68062MR572217
  11. [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. 
  12. [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 Zbl0745.68080MR1160547

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.