Vector addition systems and regular languages

A. Ginzburg; M. Yoeli

doi:10.1016/0022-0000(80)90009-4

Vector addition systems and regular languages

A. Ginzburg
, M. Yoeli

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	277-284
Number of pages	8
Journal	Journal of Computer and System Sciences
Volume	20
Issue number	3
DOIs	https://doi.org/10.1016/0022-0000(80)90009-4
State	Published - Jun 1980

Access to Document

10.1016/0022-0000(80)90009-4

Cite this

@article{60c953dcdcb84af59cfe718b1b1fa1e2,

title = "Vector addition systems and regular languages",

abstract = "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.",

author = "A. Ginzburg and M. Yoeli",

year = "1980",

month = jun,

doi = "10.1016/0022-0000(80)90009-4",

language = "אנגלית",

volume = "20",

pages = "277--284",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Vector addition systems and regular languages

AU - Ginzburg, A.

AU - Yoeli, M.

PY - 1980/6

Y1 - 1980/6

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0348188458

U2 - 10.1016/0022-0000(80)90009-4

DO - 10.1016/0022-0000(80)90009-4

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0348188458

SN - 0022-0000

VL - 20

SP - 277

EP - 284

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 3

ER -

Vector addition systems and regular languages

Abstract

Access to Document

Other files and links

Fingerprint

Cite this