Vector addition systems and regular languages

A. Ginzburg, M. Yoeli

Research output: Contribution to journalArticlepeer-review


Necessary and sufficient conditions are established for Vector Addition Systems to define regular languages. An algorithm is designed to decide whether these conditions are satisfied. The reachability problem for such Vector Addition Systems is shown to be decidable.

Original languageEnglish
Pages (from-to)277-284
Number of pages8
JournalJournal of Computer and System Sciences
Issue number3
StatePublished - Jun 1980


Dive into the research topics of 'Vector addition systems and regular languages'. Together they form a unique fingerprint.

Cite this