The context-freeness of the languages associated with vector addition systems is decidable
type: Item
instance of: scholarly article
title: The context-freeness of the languages associated with vector addition systems is decidable
zbMATH Open document ID: 0769.68067
DOI: 10.1016/0304-3975(92)90002-W
published in: Theoretical Computer Science
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 65315
zbMATH Keywords: decidability
zbMATH Keywords: vector addition systems
zbMATH Keywords: Petri nets
zbMATH Keywords: context-freeness
zbMATH Keywords: language
author: Sylvianne R. Schwer
MaRDI profile type: Publication
cites work: A note on 1-locally linear languages
cites work: Q3859267
cites work: Q4168086
cites work: Petri nets and szilard languages
cites work: Q5576254
cites work: Vector addition systems and regular languages
cites work: Q4198075
cites work: On the reachability problem for 5-dimensional vector addition systems
cites work: Parallel program schemata
cites work: Integer Programming with a Fixed Number of Variables
cites work: An Algorithm for the General Petri Net Reachability Problem
cites work: Computation sequence sets
cites work: Q3911403
cites work: Q4405392
cites work: On the rationality of Petri net languages
cites work: Fine covers of a VAS language
cites work: Petri nets and regular languages
full work available at URL: 0304-3975(92)90002-w
OpenAlex ID: W2021147005
description: scientific article; zbMATH DE number 65315