On the hierarchy of Petri net languages
- 1 January 1979
- journal article
- Published by EDP Sciences in RAIRO. Informatique théorique
- Vol. 13 (1) , 19-30
- https://doi.org/10.1051/ita/1979130100191
Abstract
RAIRO - Theoretical Informatics and Applications, an international journal on theoretical computer science and its applicationsKeywords
This publication has 16 references indexed in Scilit:
- Remarks on blind and partially blind one-way multicounter machinesTheoretical Computer Science, 1978
- Petri nets and szilard languagesInformation and Control, 1977
- Some uniformly erasable families of languagesTheoretical Computer Science, 1976
- Remarks on the complexity of nondeterministic counter languagesTheoretical Computer Science, 1976
- About three equational classes of languages built up by shuffle operationsLecture Notes in Computer Science, 1976
- A decidability theorem for a class of vector-addition systemsInformation Processing Letters, 1975
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974
- Principal AFLJournal of Computer and System Sciences, 1970
- An Infinite Hierarchy of Context-Free LanguagesJournal of the ACM, 1969
- Interpolated Denumerants and Lambert SeriesAmerican Journal of Mathematics, 1943