Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA

  • John Abela
  • François Coste
  • Sandro Spina
Conference paper

DOI: 10.1007/978-3-540-30195-0_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3264)
Cite this paper as:
Abela J., Coste F., Spina S. (2004) Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA. In: Paliouras G., Sakakibara Y. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2004. Lecture Notes in Computer Science, vol 3264. Springer, Berlin, Heidelberg

Abstract

State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, often does not converge to the target DFA and, in the case of sparse training data, does not converge at all. In this paper we argue that is partially due to the particular heuristic used in EDSM and also to the greedy search strategy employed in EDSM. We then propose a new heuristic that is based on minimising the risk involved in making merges. In other words, the heuristic gives preference to merges, whose evidence is supported by high compatibility with other merges. Incompatible merges can be trivially detected during the computation of the heuristic. We also propose a new heuristic limitation of the set of candidates after a backtrack to these incompatible merges, allowing to introduce diversity in the search.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • John Abela
    • 1
  • François Coste
    • 2
  • Sandro Spina
    • 1
  1. 1.Department of Computer Science & AIUniversity of MaltaMalta
  2. 2.INRIA/IRISARennes CedexFrance

Personalised recommendations