Unambiguous Automata Inference by Means of State-Merging Methods-Reference-Cited by-同舟云学术

Unambiguous Automata Inference by Means of State-Merging Methods

Published:2003 Issue: Volume: Page:60-71
ISSN:0302-9743
Container-title:Machine Learning: ECML 2003
language:
Short-container-title:

Author:

Coste François,Fredouille Daniel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-39857-8_8

Reference17 articles.

1. Abbadingo one (1998), http://abbadingo.cs.unm.edu/

2. Alquézar, R., 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 1994, Nahariya (Israel), pp. 291–300 (1995)

3. Lecture Notes in Artificial Intelligence;F. Coste,2000

4. Coste, F., Fredouille, D.: What is the search space for the inference of nondeterministic, unambiguous and deterministic automata? Technical report, IRISA (2003) (to appear), download http://www.irisa.fr/prive/dfredoui/down/report.ps.gz

5. Coste, F.: State merging inference of finite state classifiers. Technical Report INRIA/RR-3695, IRISA (September 1999)

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Comparison of Selected Variable Ordering Methods for NFA Induction;Lecture Notes in Computer Science;2019

2. Parallel induction of nondeterministic finite automata revisited;AIP Conference Proceedings;2017

3. State Merging Algorithms;Grammatical Inference;2016-10-26

4. On Parallel Induction of Nondeterministic Finite Automata;Procedia Computer Science;2016

5. On the Inference of Finite State Automata from Positive and Negative Data;Topics in Grammatical Inference;2016