Arrow Research search
Back to TCS

TCS 1984

Projection lemmas for ω-languages

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

The paper presents projection lemmas relating the infinite behaviour of deterministic and unboundedly branching nondeterministic infinite automata.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
1131891086146773715
v2026.09.13