State-merging DFA induction algorithms with mandatory merge constraints

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

Volumn 5278 LNAI, Issue , 2008, Pages 139-153

  Lambeau, Bernard ^a   Damas, Christophe ^a   Dupont, Pierre ^a,b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b UCL Machine Learning Group

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; INFERENCE ENGINES; MERGERS AND ACQUISITIONS;

DOMAIN KNOWLEDGES; INDUCTION ALGORITHMS; MERGING ALGORITHMS; MERGING TECHNIQUES; NEGATIVE INFORMATIONS; REGULAR LANGUAGES; SIDE EFFECTS;

MERGING;

EID: 56649105032     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88009-7_11     Document Type: Conference Paper

References (11)

1. Oncina, J., García, P.: Identifying regular languages in polynomial time. In: Bunke, H. (ed.) Advances in Structural and Syntactic Pattern Recognition. Series in Machine Perception and Artificial Intelligence, vol. 5, pp. 99-108. World Scientific, Singapore (1992)
2. Lang, K., Pearlmutter, B., Price, R.: Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol. 1433, pp. 1-12. Springer, Heidelberg (1998)
3. Gold, E.: Language identification in the limit. Information and Control 10(5), 447-474 (1967)
4. Coste, F., Nicolas, J.: How considering incompatible state mergings may reduce the DFA induction search tree. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol. 1433, pp. 199-210. Springer, Heidelberg (1998)
5. Coste, R, Fredouille, D., Kermorvant, C., de la Higuera, C.: Introducing domain and typing bias in automata inference. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol. 3264, pp. 115-126. Springer, Heidelberg (2004)
6. Damas, C., Lambeau, B., Dupont, P., van Lamsweerde, A.: Generating annotated behavior models from end-user scenarios. IEEE Transactions on Software Engineering 31(12), 1056-1073 (2005)
7. Dupont, P., Lambeau, B., Damas, C., van Lamsweerde, A.: The QSM algorithm and its application to software behavior model induction. Applied Artificial Intelligence 22, 77-115 (2008)
8. Dupont, P., Miclet, L., Vidal, E.: What is the search space of the regular inference? In: Car-rasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol. 862, pp. 25-37. Springer, Heidelberg (1994)
9. Oncina, J., Varó, M.A.: Using domain information during the learning of a subsequential transducer. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS, vol. 1147, pp. 301-312. Springer, Heidelberg (1996)
10. Uchitel, S., Kramer, J., Magee, J.: Synthesis of behavorial models from scenarios. IEEE Transactions on Software Engineering 29(2), 99-115 (2003)
11. Dupont, P.: Incremental regular inference. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS, vol. 1147, pp. 222-237. Springer, Heidelberg (1996)