Skip to main navigation
Skip to search
Skip to main content
The Hebrew University of Jerusalem Home
Approve / Request updates on publications
Home
Profiles
Research units
Research output
Prizes
Search by expertise, name or affiliation
Typeness for ω-regular automata
Orna Kupferman
*
, Gila Morgenstern
, Aniello Murano
*
Corresponding author for this work
The Rachel and Selim Benin School of Engineering and Computer Science
Research output
:
Chapter in Book/Report/Conference proceeding
›
Chapter
›
peer-review
17
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Typeness for ω-regular automata'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Automata
100%
Non-deterministic
54%
Acceptance Conditions
27%
Power Set
27%
Rabin
18%
Subset Construction
18%
Automata over Infinite alphabets
9%
Blowing
9%
Condition Classes
9%
Deterministic Structures
9%
Computer Science
Automaton
100%
Powerset
25%
Subset Construction
16%