Skip to main navigation
Skip to search
Skip to main content
Ben-Gurion University Research Portal Home
Help & FAQ
Home
Profiles
Research output
Research units
Prizes
Press/Media
Student theses
Projects
Activities
Datasets
Research Labs / Equipment
Search by expertise, name or affiliation
Query learning of derived ω-tree languages in polynomial time
Dana Angluin
, Timos Antonopoulos
,
Dana Fisman
Research output
:
Contribution to journal
›
Article
›
peer-review
3
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Query learning of derived ω-tree languages in polynomial time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Polynomial Time
100%
Word Language
100%
Tree Languages
100%
Query Learning
100%
Non-deterministic
50%
Regular Words
50%
Subset Queries
50%
Polynomial-time Algorithm
25%
Finite Words
25%
Learning Algorithm
25%
Membership Query
25%
Equivalence Queries
25%
General Polynomial
25%
Regular Tree
25%
Infinite Trees
25%
Polynomial-time Reduction
25%
Computer Science
Polynomial Time
100%
Polynomial Time Algorithm
20%
Learning Algorithm
20%
Query Equivalence
20%
Deterministic Finite
20%