scientific article; zbMATH DE number 512868

MaRDI QIDQ4281565zbMATH OpenFDO

Authors Ludwig Staiger

Publication date 13 November 1994

zbMATH Keywords

\(\omega\)-languagesarithmetical hierarchyBüchi automatarecursive automataspecificationsverification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 4019040
• Acceptance Conditions for ω-Languages
• scientific article; zbMATH DE number 1678376
• Alternating finite automata on -words
• Accepting conditions for automata on -languages

Cited in

(13)

• Finite acceptance of infinite words
• On an effective hierarchy of communicating processes: Separation principle and testing
• Index sets in computable analysis
• Effectively closed sets and graphs of computable real functions.
• The exact complexity of the infinite Post Correspondence Problem
• scientific article; zbMATH DE number 1678376 (Why is no real title available?)
• scientific article; zbMATH DE number 4019040 (Why is no real title available?)
• How to Split Recursive Automata
• scientific article; zbMATH DE number 3976377 (Why is no real title available?)
• On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
• On the high complexity of Petri nets -languages
• Jumping automata over Infinite words
• Decision problems for Turing machines

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281565)