Abstract
This paper shows that the languages over a one-letter alphabet generated by context-free matrix grammars are always regular. Moreover we give a decision procedure for the question of whether a context-free matrix language is finite. Hereby we strengthen a result of [Mk 92] and settle a number of open questions in [DP 89]. Both results are obtained by a reduction to Petri net problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dassow, J., Pâun, G.: Regular rewriting in formal language theory. (EATCS Monographs on Theoretical Computer Science) Berlin, Heidelberg, New York: Springer 1989
Ginsburg, S., Greibach, S., Harrison, M.A.: One-way stack automata. J. ACM14, 389–418 (1967)
Hauschildt, D. Semilinearity of the reachability set is decidable for Petri nets. Doctoral Thesis, Dept. of Computer Science, University of Hamburg (1990). Also appeared as: Dept. of Computer Science, University of Hamburg, Technical Report No. FBI-HH-B-146/90
Kosaraju, S.R. Decidability of reachability in vector addition systems. Proc. 14th Ann. ACM STOC (1982), pp. 267-281
Kleine Büning, H., Lettmann, T., Mayr, E.: Projections of vector addition system reachability sets are semilinear, TCS64, 343–350 (1989)
Lambert J.L.: Consequences of the decidability of the reachability problem for Petri nets. Rapport de recherche no 313, L.R.I., Universite de Paris-Sud (1986)
Lambert, J.L.: Some Consequences of the decidability of the reachability problem for Petri nets. Advances in Petri Nets 1988 (Lect. Notes Comput. Sci., vol. 340, pp. 266–282) Berlin, Heidelberg, New York: Springer 1988
Lambert, J.L.: Vector Addition Systems and Semi-Linearity. Prepublication de l'Universite Paris-Nord. Departement d'Informatique, N 90–8 (1990); also to appear in: SIAM J. Comput.
Mayr, E. W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput.13, 441–460 (1984)
Mäkinen, E.: On the generative capacity of context-free matrix grammars over one-letter alphabet. Fund. Inf.16, 93–97 (1992)
Gonczarowski, J., Warmuth, M.K.: Scattered versus context-sensitive rewriting. Acta Inf.27, 81–95 (1989)
Rosenkranz, D.J.: Programmed grammars and classes of formal languages. J. ACM16, 107–131 (1969)
Schwer, S.: The context-freeness of the language associated with vector addition systems is decidable. Theor. Comput. Sci.98, 199–247 (1992)
Leeuwen, J. van: Extremal properties of non-deterministic time complexity classes. In: Gelenbe, E., Poitier, D. (eds.) International Computing Symposium, pp. 61–64, Amsterdam: North-Holland/American Elsevier 1975
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hauschildt, D., Jantzen, M. Petri net algorithms in the theory of matrix grammars. Acta Informatica 31, 719–728 (1994). https://doi.org/10.1007/BF01178731
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01178731