166 search results - page 11 / 34 » Learning of Event-Recording Automata |
CONCUR
2006
Springer
14 years 1 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
FSMNLP
2008
Springer
13 years 11 months ago
2008
Springer
Weighted finite-state transducers have been used successfully in a variety of natural language processing applications, including speech recognition, speech synthesis, and machine ...
FSMNLP
2009
Springer
13 years 7 months ago
2009
Springer
Abstract. Active language learning is an interesting task for which theoretical results are known and several applications exist. In order to better understand what the better stra...
DKE
2006
13 years 9 months ago
2006
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
AAMAS
2007
Springer
14 years 3 months ago
2007
Springer
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that...