1134 search results - page 6 / 227 » Sequential Inductive Learning |
ALT
2006
Springer
14 years 6 months ago
2006
Springer
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
JMLR
2010
13 years 4 months ago
2010
Probabilistic grammars offer great flexibility in modeling discrete sequential data like natural language text. Their symbolic component is amenable to inspection by humans, while...
DATE
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper focuses on checking safety properties for sequential circuits specified on the RT-level. We study how different state encodings can be used to create a gate-level repr...
KBS
2002
13 years 9 months ago
2002
Lists of if
AAAI
1996
13 years 11 months ago
1996
Inductive algorithms rely strongly on their representational biases, Constructive induction can mitigate representational inadequacies. This paper introduces the notion of a relat...