Vector addition systems and regular languages

DOI10.1016/0022-0000(80)90009-4MaRDI QIDQ1146002zbMATH OpenOpenAlexFDO

Authors Abraham Ginzburg, Michael Yoeli

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

zbMATH Keywords

regular languagesreachability problemvector addition systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• scientific article; zbMATH DE number 3574998 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• Parallel program schemata

Cited in

(9)

• Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
• Completeness results for conflict-free vector replacement systems
• Normal and sinkless Petri nets
• On the enlargement of the class of regular languages by the shuffle closure
• Petri nets and regular languages
• Problems concerning fairness and temporal logic for conflict-free Petri nets
• Fine covers of a VAS language
• The context-freeness of the languages associated with vector addition systems is decidable
• A unified approach for deciding the existence of certain petri net paths

This page was built for publication: Vector addition systems and regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1146002)