EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 13 / No 1 (1979) RAIRO. Inform. théor., 13 1 (1979) 19-30 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 13, Number 1, 1979
Page(s) 19 - 30
DOI https://doi.org/10.1051/ita/1979130100191
Published online 01 February 2017
  1. 1. B. S. BAKER and R. V. BOOK, Reversal-Bounded Multipushdown Machines, J. Comp. Syst. Sc., Vol. 8, 1974, pp. 315-332. [MR: 375844] [Zbl: 0309.68043] [Google Scholar]
  2. 2. E. T. BELL, Interpolated Denumerants and Lambert Series, Amer. J. Math., Vol. 65, 1943, pp. 382-386. [MR: 9043] [Zbl: 0060.09603] [Google Scholar]
  3. 3. W. BRAUER, On Grammatical Complexity of Context-Free Languages, M.F.C.S. Proceedings of Symposium and Summerschool, High Tatras, 1973, pp. 191-196. [MR: 398178] [Google Scholar]
  4. 4. S. CRESPI-REGHIZZI and D. MANDRIOLI, Petri Nets and Commutative Grammars, Technical Report 74-5, Istituto Elettronica del Politecnico di Milano, 1974. [Google Scholar]
  5. 5. S. CRESPI-REGHIZZI and D. MANDRIOI, A Decidability Theorem for a Class of Vector-Addition Systems, Information Processing Letters, Vol. 3, 1975, pp. 78-80. [MR: 421162] [Zbl: 0302.68065] [Google Scholar]
  6. 6. S. CRESPI-REGHIZZI and D. MANDRIOLI, Petri Nets and Szilard Languages, Information and Control, Vol. 33, 1977, pp. 177-192. [MR: 426506] [Zbl: 0354.68098] [Google Scholar]
  7. 7. S. GINSBURG and S. A. GREIBACH, Principal AFL, J. Comp. Syst. Sc., Vol. 4, 1970, pp. 308-338. [MR: 286599] [Zbl: 0198.03102] [Google Scholar]
  8. 8. S. GINSBURG, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland Publishing Company, 1975. [MR: 443446] [Zbl: 0325.68002] [Google Scholar]
  9. 9. S. GINSBURG, J. GOLDSTINE and S. A. GREIBACH, Some Uniformly Erasable Families of Languages, Theoretical Computer Science, Vol. 2, 1976, pp. 29-44. [MR: 411254] [Zbl: 0343.68033] [Google Scholar]
  10. 10. S. A. GREIBACH, An Infinite Hierarchy of Context-Free Languages, J. Assoc. Computing Machinery, Vol. 16, 1969, pp. 91-106. [MR: 238632] [Zbl: 0182.02002] [Google Scholar]
  11. 11. S. A. GREIBACH, Remarks on the Complexity of Nondeterministic Counter Languages, Theoretical Computer Science, Vol. 1, 1976, pp. 269-288. [MR: 411257] [Zbl: 0332.68039] [Google Scholar]
  12. 12. S. A. GREIBACH, Remarks on Blind and Partially Blind One-Way Multicounter Machines, Submitted for Publication, 1978. [MR: 513714] [Zbl: 0389.68030] [Google Scholar]
  13. 13. M. HACK, Petri Net Languages, Computation Structures Group Memo 124, Project MAC, M.I.T., 1975. [Google Scholar]
  14. 14. M. HÖPNER, Über den Zusammenhang von Szilardsprachen und Matrixgrammatiken, Technical Report IFI-HH-B-12/74, Univ. Hamburg, 1974. [Google Scholar]
  15. 15. M. HÖPNER and M. OPP, About Three Equational Classes of Languages Built up by Shuffle Operations, Lecture Notes in Computer Science, Springer, Vol. 45, 1976, pp. 337-344. [Zbl: 0413.68072] [Google Scholar]
  16. 16. M. JANTZEN, Eigenschaften von Petrinetzsprachen, Research Report, Univ. Hamburg, 1978. [Google Scholar]
  17. 17. M. LATTEUX, Cônes rationnels commutativement clos, R.A.I.R.O., Informatique théorique, Vol. 11, 1977, pp. 29-51. [EuDML: 92040] [MR: 478782] [Zbl: 0354.68103] [Google Scholar]
  18. 18. J. VAN LEEUWEN, A Partial Solution to the Reachibility-Problem for Vector Addition Systems, Proceedings of the 6th annual A.CM. Symposium on Theory of Computing, 1974, pp. 303-309. [MR: 413611] [Zbl: 0362.68105] [Google Scholar]
  19. 19. E. MORIYA, Associate Languages and Derivational Complexity of Formal Grammars and Languages, Information and Control, Vol. 22, 1973, pp. 139-162. [MR: 323171] [Zbl: 0254.68017] [Google Scholar]
  20. 20. B. O. NASH, Reachibility Problems in Vector-Addition Systems, Amer. Math. Monthly, Vol. 80, 1973, pp. 292-295. [MR: 319420] [Zbl: 0273.68034] [Google Scholar]
  21. 21. J. L. PETERSON, Computation Sequence Sets, J. Comp. Syst. Sc., Vol. 13, 1976, pp. 1-24. [MR: 411260] [Zbl: 0354.68100] [Google Scholar]
  22. 22. M. PENTTONEN, On Derivation Languages Corresponding to Context-Free Grammars, Acta Informatica, Vol. 3, 1974, pp. 285-293. [MR: 349074] [Zbl: 0268.68033] [Google Scholar]
  23. 23. G. S. SACERDOTE and R. L. TENNEY, The Decidability of the Reachability Problem for Vector-Addition Systems, Proceedings of the 9th annual A.C.M. Symposium on Theory of Computing, 1977, pp. 61-76. [MR: 488989] [Google Scholar]
  24. 24. A. SALOMAA, Formal Languages, Academic Press New York and London, 1973. [MR: 438755] [Zbl: 0262.68025] [Google Scholar]
  25. 25. E. D. STOTZKIJ, On Some Restrictions on Derivations in Phrase-Structure Grammars, Akad. Nauk. S.S.S.R. Nauchno-Tekhn., Inform. Ser. 2, 1967, pp. 35-38 (in Russian). [Google Scholar]
  26. 26. R. VALK, Self-Modifying Nets, Technical Report IFI-HH-B-34/77, Univ. Hamburg, 1977. [Zbl: 0415.68025] [Google Scholar]
  27. 27. G. VIDAL-NAQUET, Méthodes pour les problèmes d'ndécidabilité et de complexité sur les réseaux de Petri, in Proceedings of the AFCET Workshop on Petri Nets, Paris, 1977, pp. 137-144. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.