The context-freeness of the languages associated with vector addition systems is decidable

DOI10.1016/0304-3975(92)90002-WzbMath0769.68067OpenAlexW2021147005MaRDI QIDQ1193880

Sylvianne R. Schwer

Publication date: 27 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90002-w

zbMATH Keywords

Petri netslanguagedecidabilityvector addition systemscontext-freeness

Mathematics Subject Classification ID

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

Related Items (5)

Context-Freeness of Word-MIX Languages ⋮ Petri net algorithms in the theory of matrix grammars ⋮ A note on fine covers and iterable factors of VAS languages ⋮ Fine covers of a VAS language ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the rationality of Petri net languages
• Vector addition systems and regular languages
• On the reachability problem for 5-dimensional vector addition systems
• Petri nets and regular languages
• Fine covers of a VAS language
• Computation sequence sets
• Parallel program schemata
• Integer Programming with a Fixed Number of Variables
• An Algorithm for the General Petri Net Reachability Problem
• Petri nets and szilard languages
• A note on 1-locally linear languages

This page was built for publication: The context-freeness of the languages associated with vector addition systems is decidable