Learning a regular tree language from a teacher
F Drewes, J Högberg - … Conference on Developments in Language Theory, 2003 - Springer
We generalize an inference algorithm by Angluin, that learns a regular string language from
a “minimally adequate teacher”, to regular tree languages. This improves a similar algorithm
proposed by Sakakibara. In particular, we show how our algorithm can be used to avoid
dead states, thus answering a question by Sakakibara.
a “minimally adequate teacher”, to regular tree languages. This improves a similar algorithm
proposed by Sakakibara. In particular, we show how our algorithm can be used to avoid
dead states, thus answering a question by Sakakibara.
以上显示的是最相近的搜索结果。 查看全部搜索结果