OpenAlex
PricingAboutJobs
Log inGet started
Work

Inductive inference, DFAs, and computational complexity

HTML

Year: 1989
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Analogical and Inductive Inference: International Workshop All '89 Reinhardsbrunn Castle, GDR, October 1–6, 1989 Proceedings
DOI: 10.1007/3-540-51734-0_50
Author: Leonard Pitt
Institution: University of Illinois Urbana-Champaign
Language: English

Topic: semigroups and automata theory
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: deterministic finite automata, inductive reasoning, computational learning theory, computational complexity, learning algorithms

Open Access status: closed
OpenAlex ID: W1607995248
FWCI: 4.265
Cites: 66
Cited by: 241
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