OpenAlex
PricingAboutJobs
Log inGet started
Work

Negative Results for Equivalence Queries

HTML PDF

Year: 1990
Type: article
Source: Machine Learning
DOI: 10.1007/bf00116034
Author: Dana Angluin
Institution: Yale University
Language: English

Topic: semigroups and automata theory
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: equivalence queries, exact identification, negative results, computational complexity, finite automata, context-free grammars, disjunctive normal form, conjunctive normal form, Boolean formulas, polynomial-time algorithms

Open Access status: bronze

Funder: National Science Foundation
Award: Theory of Learning Algorithms
OpenAlex ID: W2088181725
FWCI: 13.4
Cites: 24
Cited by: 259
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms