A note on fine covers and iterable factors of VAS languages

DOI10.1016/0020-0190(95)00168-2zbMath1022.68574OpenAlexW26326129MaRDI QIDQ1352084

Hsu-Chun Yen

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw//handle/246246/142310

zbMATH Keywords

complexityfinite automataPetri net languagesvector addition system languages

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 (2)

ON YEN'S PATH LOGIC FOR PETRI NETS ⋮ On Yen’s Path Logic for Petri Nets

Cites Work

• 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
• Parallel program schemata

This page was built for publication: A note on fine covers and iterable factors of VAS languages