1052 search results - page 107 / 211 » The Regular Real-Time Languages |
145
click to vote
WSC
2007
15 years 6 months ago
2007
In this paper we present a survey on methods for the synthesis of Petri nets from behavioral descriptions given as languages. We consider place/transition Petri nets, elementary P...
142
click to vote
JMLR
2010
14 years 10 months ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
126
click to vote
LATA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
165
click to vote
EELC
2006
15 years 7 months ago
2006
We present a neural-competitive learning model of language evolution in which several symbol sequences compete to signify a given propositional meaning. Both symbol sequences and p...
138
click to vote
NIPS
2004
15 years 5 months ago
2004
Statistical language models estimate the probability of a word occurring in a given context. The most common language models rely on a discrete enumeration of predictive contexts ...