✦ LIBER ✦

On the topological complexity of ω-languages of non-deterministic Petri nets

✍ Scribed by Finkel, Olivier; Skrzypczak, Michał

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the ω-language Expressive Power of Ex

✍ A. Finkel; G. Geeraerts; J.-F. Raskin; L. Van Begin 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 359 KB

On the rationality of Petri net language

✍ Sylvianne R. Schwer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 118 KB

On the Regularity of Petri Net Languages

✍ Hsu-Chun Yen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 804 KB

An empirical study on the complexity met

✍ Lee Gang Soo; Yoon Jung-Mo 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 507 KB

On the Tape Complexity of Deterministic

✍ Sudborough, I. H. 📂 Article 📅 1978 🏛 Association for Computing Machinery 🌐 English ⚖ 691 KB

On the coverability and reachability lan

✍ Delzanno, Giorgio; Rosa-Velardo, Fernando 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 492 KB