On the rationality of Petri net languages

DOI10.1016/0020-0190(86)90060-8zbMath0588.68037OpenAlexW2075261907MaRDI QIDQ1073575

Sylvianne R. Schwer

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90060-8

zbMATH Keywords

pumping lemmacharacteristic matrix

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)

Fine covers of a VAS language ⋮ The context-freeness of the languages associated with vector addition systems is decidable

Cites Work

• A note on 1-locally linear languages
• Unnamed Item
• Unnamed Item

This page was built for publication: On the rationality of Petri net languages