On the High Complexity of Petri Nets $$\omega $$-Languages
Lecture Notes in Computer Science , Volume 12152, pp 69-88; doi:10.1007/978-3-030-51831-8_4
The publisher has not yet granted permission to display this abstract.
Keywords: Petri nets / Infinite Words / Borel hierarchy / Automata and Formal Languages / Wadge hierarchy / logic in computer science / Cantor Topology / Wadge Degrees / Highly undecidable properties
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Click here to see the statistics on "Lecture Notes in Computer Science" .