The Context-Freeness of the Languages Associated with Vector Addition Systems is Decidable
暂无分享,去创建一个
[1] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.
[2] Sylviane R. Schwer. On the Rationality of Petri Net Languages , 1986, Inf. Process. Lett..
[3] Sylviane R. Schwer. Fine Covers of a VAS Language , 1992, Theor. Comput. Sci..
[4] S. Rao Kosaraju,et al. Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.
[5] John E. Hopcroft,et al. On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..
[6] W. Rudin. Real and complex analysis , 1968 .
[7] Rüdiger Valk,et al. Petri Nets and Regular Languages , 1981, J. Comput. Syst. Sci..
[8] Ernst W. Mayr. An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..
[9] Hendrik W. Lenstra,et al. Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..
[10] James L. Peterson. Computation Sequence Sets , 1976, J. Comput. Syst. Sci..
[11] Michel Hack,et al. Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.
[12] Luc Boasson,et al. On languages satisfying Ogden's lemma , 1978, RAIRO Theor. Informatics Appl..
[13] Rüdiger Valk,et al. On the rationality of Petri net languages , 1977, Theoretical Computer Science.
[14] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .
[15] Luc Boasson,et al. A Note on 1-Locally Linear Languages , 1978, Inf. Control..
[16] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .
[17] James Lyle Peterson,et al. Petri net theory and the modeling of systems , 1981 .
[18] Michael Yoeli,et al. Vector Addition Systems and Regular Languages , 1980, J. Comput. Syst. Sci..
[19] Richard M. Karp,et al. Parallel Program Schemata , 1969, J. Comput. Syst. Sci..
[20] Stefano Crespi-Reghizzi. Petri Nets and Szilard Languages , 1977, Inf. Control..