Fine covers of a VAS language

DOI10.1016/0304-3975(92)90071-MMaRDI QIDQ1186433zbMATH OpenOpenAlexFDO

Authors Sylvianne R. Schwer

Publication date 28 June 1992

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

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

zbMATH Keywords

covering automatonPetri netsvector addition systems

Mathematics Subject Classification ID

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

Recommendations

• A note on fine covers and iterable factors of VAS languages
• scientific article; zbMATH DE number 5003534
• Cover complexity of finite languages
• scientific article; zbMATH DE number 1156871
• Lamination languages
• On the cover complexity of finite languages
• Varieties and covarieties of languages (extended abstract)
• Finitary languages
• Thin and slender languages

Cites work

• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• On the rationality of Petri net languages
• Parallel program schemata
• Petri nets and regular languages
• The context-freeness of the languages associated with vector addition systems is decidable
• Vector addition systems and regular languages

Cited in

(3)

• The context-freeness of the languages associated with vector addition systems is decidable
• A note on fine covers and iterable factors of VAS languages
• S-arrangements with repetitions

This page was built for publication: Fine covers of a VAS language

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