Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

AII
1989

favoriteEmaildiscussreport

101views Software Engineering» more AII 1989»

Inductive Inference, DFAs, and Computational Complexity

13 years 9 months ago

Inductive Inference, DFAs, and Computational Complexity

Download www.cs.berkeley.edu

This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferred, and highlight a number of interesting approaches in computational learning theory.

Leonard Pitt

Real-time Traffic

AII 1989 | Computational Learning Theory | Deterministic Finite Automata | Interesting Approaches | Software Engineering |

claim paper

Related Content

» A computational approximation to the AIXI model

» Rademacher Complexity and Grammar Induction Algorithms What It May Not Tell Us

» Learning DFA evolution versus evidence driven state merging

» Corpusbased Pattern Induction for a Knowledgebased Question Answering Approach

» What were you thinking filling in missing dataflow through inference in learning from demo...

» Learning from Multiple Sources of Inaccurate Data

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1989
Where	AII
Authors	Leonard Pitt

Comments (0)