Efficient ambiguity detection in C-NFA: A step towards the inference of non deterministic automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1891, Issue , 2000, Pages 25-38

  Coste, François ^a   Fredouille, Daniel ^a  

^a INRIA   (France)

Author keywords

Finite state classifier; Non deterministic automata; Regular inference; Sequence discrimination

Indexed keywords

COMPUTATIONAL GRAMMARS; FINITE AUTOMATA; INFERENCE ENGINES;

DETECTION FRAMEWORK; FINITE STATE CLASSIFIERS; INFERENCE PROCESS; NEGATIVE SAMPLES; NONDETERMINISTIC AUTOMATA; REGULAR INFERENCE; SEQUENCE DISCRIMINATION; STATE-MERGING;

PIPELINE PROCESSING SYSTEMS;

EID: 84974696057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45257-7_3     Document Type: Conference Paper

References (16)

1. Alquézar R. –Symbolic and connectionist learning techniques for grammatical inference.–Thèse de PhD, Universitat Politecnica de Catalunya, mars 1997.
2. Alquézar R. et Sanfeliu A. –Incremental grammatical inference from positive and negative data using unbiased finite state automata. In: Shape, Structure and Pattern Recognition, Proc. Int. Workshop on Structural and Syntactic Pattern Recognition, SSPR ’94, Nahariya (Israel), pp. 291-300.–1995.
3. Biermann A. W. et Feldmann J. A. –On the synthesis of finite-state machines from samples of their behaviour. IEEE Transactions on Computeurs C 21, 1972, pp. 592-597.
4. Coste F. et Nicolas J. –Regular inference as a graph coloring problem. In: Workshop on Grammar Inference, Automata Induction, and Language Acquisition (ICML ’ 97).–Nashville, TN., USA, juillet 1997.
5. Coste F. –State merging inference of finite state classifiers.-Rapport technique n° INRIA/RR-3695, IRISA, septembre 1999.
6. de la Higuera C. –Characteristic sets for polynomial grammatical inference. Machine Learning, vol. 27, 1997, pp. 125-138.
7. Denis F., Lemay A. et Terlutte A. –Apprentissage de langages réguliers à l’aide d’automates non détérministes. In: Conférence d’apprentissage Cap’00.–2000.
8. Dupont P. –Utilisation et apprentissage de modèles de langages pour la reconnaissance de la parole continue. –Thèse de PhD, Ecole Nationale Supérieure des Télécommunications, 1996.
9. Gold E. M. –Complexity of automaton identification from given data. Information and Control, vol. 37, 1978, pp. 302-320.
10. Hopcroft J. et Ullman J. –Introduction to Automata Theory, Languages, and Computation.–N. Reading, MA, Addison-Wesley, 1980.
11. Lang K. J. –Random dfa’s can be approximately learned from sparse uniform examples. 5th ACM workshop on Computation Learning Theorie, 1992, pp. 45-52.
12. Lang K. J., Pearlmutter B. A. et Price R. A. –Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. Lecture Notes in Computer Science, vol. 1433, 1998, pp. 1-12.
13. Oncina J. et Garcia P. –Inferring regular languages in polynomial update time. Pattern Recognition and Image Analysis, 1992, pp. 49-61.
14. Oliveira A. L. et Silva J. P. M. –Efficient search techniques for the inference of minimum size finite automata. In: South American Symposium on String Processing and Information Retrieval.–1998.
15. Salomaa K., et Yu S. –Nfa to dfa transformation for finite languages. In: First international workshop on implementing automata, WIA’96, p. 188–1997.
16. Yokomori T. –Learning non-deterministic finite automata from queries and counterexamples. Machine Intelligence, vol. 13, 1994, pp. 169-189.