On the Learnability of Infinitary Regular Sets
摘要：
In this paper we extend the automaton synthesis paradigm to infinitary languages, that is, to subsets of the set Σ ω of all infinite sequences over some alphabet Σ . Our main result is a polynomial algorithm for learning a sub-class of the ω-regular sets from membership queries and counter-examples based on the framework suggested by Angluin (Angluin, D. (1987), Inform. and Comput. 75 , 87-106) for learning regular subsets of Σ *.
展开
关键词：
Practical, Theoretical or Mathematical/ formal languages/ learnability infinitary regular sets automaton synthesis paradigm infinitary languages polynomial algorithm membership queries counter-examples/ C4210L Formal languages and computational linguistics
DOI：
10.1006/inco.1995.1070
被引量：
年份：
1995
Elsevier
(全网免费下载)
Semantic Scholar
(全网免费下载)
ResearchGate
(全网免费下载)
Citeseer
(全网免费下载)
www-verimag.imag.fr
(全网免费下载)
goal.im.ntu.edu.tw
(全网免费下载)
通过文献互助平台发起求助，成功后即可免费获取论文全文。
相似文献
参考文献
引证文献
引用走势
辅助模式
引用
文献可以批量引用啦~
欢迎点我试用！
