On the relationship between diagram synthesis and grammatical inference erkki makinen
Erkki Mäkinen · International Journal of Computer Mathematics · 1994
Biermann's algorithm for synthesizing state diagrams is reformulated by using standard concepts of grammatical inference. For each instance of the diagram synthesis problem we define an instance of a grammatical inference problem. A restricted case of the diagram synthesis problem is introduced in order to find such a special case in which the corresponding language inference problem can be efficiently solved by using positive data only.