scientific article; zbMATH DE number 512868
From MaRDI portal
Publication:4281565
zbMath0799.68139MaRDI QIDQ4281565
Publication date: 13 November 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
verificationBüchi automataspecificationsarithmetical hierarchy\(\omega\)-languagesrecursive automata
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (8)
On the High Complexity of Petri Nets $$\omega $$-Languages ⋮ Decision problems for Turing machines ⋮ Finite acceptance of infinite words ⋮ On an effective hierarchy of communicating processes: Separation principle and testing ⋮ Index sets in computable analysis ⋮ The exact complexity of the infinite Post Correspondence Problem ⋮ On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words ⋮ Effectively closed sets and graphs of computable real functions.
This page was built for publication:
