72 search results - page 3 / 15 » Learning Stochastic Finite Automata |
AII
1989
13 years 10 months ago
1989
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 inferr...
COLT
1995
Springer
13 years 9 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
IJCSA
2007
13 years 6 months ago
2007
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
ALT
2009
Springer
14 years 3 months ago
2009
Springer
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
WIA
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. In computer science methods to aid learning are very imporcause abstract models are used frequently. For this conventional teaching methods do not suffice. We have develo...