Vector addition systems and regular languages
From MaRDI portal
Publication:1146002
DOI10.1016/0022-0000(80)90009-4zbMath0446.68043OpenAlexW2089970856MaRDI QIDQ1146002
Michael Yoeli, Abraham Ginzburg
Publication date: 1980
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(80)90009-4
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (9)
Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states ⋮ Completeness results for conflict-free vector replacement systems ⋮ Problems concerning fairness and temporal logic for conflict-free Petri nets ⋮ Petri nets and regular languages ⋮ A unified approach for deciding the existence of certain petri net paths ⋮ Fine covers of a VAS language ⋮ The context-freeness of the languages associated with vector addition systems is decidable ⋮ Normal and sinkless Petri nets ⋮ On the enlargement of the class of regular languages by the shuffle closure
Cites Work
This page was built for publication: Vector addition systems and regular languages
