161 search results - page 2 / 33 » Learning Finite Automata Using Label Queries |
WIA
2005
Springer
14 years 25 days ago
2005
Springer
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We use them to model musical styles: a same automaton can be used to...
IJCSA
2007
13 years 7 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 ...
IJCAI
1993
13 years 8 months ago
1993
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
FOSSACS
2000
Springer
13 years 11 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...