Coste (F.). -- State merging inference of finite state classifiers. -- Rapport technique n INRIA/RR-3695, IRISA, septembre 1999. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Efficient Ambiguity Detection in C-NFA: A Step Towards the.. - Coste, Fredouille (Correct)
....to efficiently characterize the disjunction of the recognized languages. We propose to take advantage of this property in the next sections devoted to the inference of unambiguous C NFA. 1. 2 State Merging Inference The problem of inferring a C NFA may be seen as a C regular inference problem [Cos99]. We assume that a training sample S = hS c i c2 Gamma is given such that each S c is a sample from the target language L c (M ) i.e. a finite subset of L c (M ) One classical assumption made in grammatical inference is that the sample is structurally complete with respect to the target ....
Coste (F.). -- State merging inference of finite state classifiers. -- Rapport technique n INRIA/RR-3695, IRISA, septembre 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC