Petri Nets and Regular Languages

[1]  Michael Yoeli,et al.  Vector Addition Systems and Regular Languages , 1980, J. Comput. Syst. Sci..

[2]  Kurt Lautenbach,et al.  Elements of General Net Theory , 1979, Advanced Course: Net Theory and Applications.

[3]  Rüdiger Valk,et al.  Formal Properties of Place/Transition Nets , 1979, Advanced Course: Net Theory and Applications.

[4]  Matthias Jantzen,et al.  On the hierarchy of Petri net languages , 1979, RAIRO Theor. Informatics Appl..

[5]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

[6]  Stefano Crespi-Reghizzi.  Petri Nets and Szilard Languages , 1977, Inf. Control..

[7]  Rüdiger Valk,et al.  On the rationality of Petri net languages , 1977, Theoretical Computer Science.

[8]  James L. Peterson.  Computation Sequence Sets , 1976, J. Comput. Syst. Sci..

[9]  M. Hack,et al.  PETRI NET LANGUAGE , 1976 .

[10]  Michel Hack,et al.  Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[11]  Brenda S. Baker,et al.  Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[12]  D. Siefkes.  Review: Michael O. Rabin, Decidability of Second-order Theories and Automata on Infinite Trees , 1972 .

[13]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[14]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[15]  Sheila A. Greibach,et al.  An Infinite Hierarchy of Context-Free Languages , 1967, JACM.

[16]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .