scientific article; zbMATH DE number 6423739

zbMath1310.68130MaRDI QIDQ4982345

Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre

Publication date: 9 April 2015

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

automata theoryPetri netstopological complexityBorel hierarchyWadge hierarchyCantor topologylanguages of infinite wordsWadge degreespartially blind multicounter automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Descriptive set theory (03E15) Games involving topology, set theory, or logic (91A44) Automata and formal grammars in connection with logical questions (03D05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

On the High Complexity of Petri Nets $$\omega $$-Languages ⋮ Polishness of some topologies related to word or tree automata ⋮ On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words

This page was built for publication: