Persistence of vector replacement systems is decidable
- 1 June 1981
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 15 (3) , 309-318
- https://doi.org/10.1007/bf00289268
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Decidability of reachability in persistent vector replacement systemsPublished by Springer Nature ,2005
- Properties of Conflict-Free and Persistent Petri NetsJournal of the ACM, 1978
- A 222pn upper bound on the complexity of Presburger ArithmeticJournal of Computer and System Sciences, 1978
- Decidable problems on the strong connectivity of Petri net reachability setsTheoretical Computer Science, 1977
- Synchronization and computing capabilities of linear asynchronous structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- A fundamental theorem of asynchronous parallel computationPublished by Springer Nature ,1975
- Parallel program schemataJournal of Computer and System Sciences, 1969
- On Context-Free LanguagesJournal of the ACM, 1966
- Semigroups, Presburger formulas, and languagesPacific Journal of Mathematics, 1966
- Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime FactorsAmerican Journal of Mathematics, 1913