Binary (generalized) Post Correspondence Problem
- 作者Vesa Halava; Tero Harju; Mika Hirvensalo
- 卷第276卷
- 印刷ISSN0304-3975
- 文件大小207.77KB
- 发表时间2002
- DOI10.1016/s0304-3975(01)00157-8
- 页码183-204
同作者推荐
The Intrinsic Complexity of Language IdentificationSanjay Jain; Arun Sharma · 1996
Robust Learning Aided by ContextJohn Case; Sanjay Jain; Matthias Ott; Arun Sharma; Frank Stephan · 2000
Program size restrictions in computational learningSanjay Jain; Arun Sharma · 1994
Characterizing language identification by standardizing operationsSanjay Jain; Arun Sharma · 1994
On aggregating teams of learning machinesSanjay Jain; Arun Sharma · 1995
Anomalous learning helps succinctnessJohn Case; Sanjay Jain; Arun Sharma · 1996
ON LEARNING LIMITING PROGRAMSCASE, JOHN; JAIN, SANJAY; SHARMA, ARUN · International Journal of Foundations of Computer Science · 1992
Synthesizing noise-tolerant language learnersJohn Case; Sanjay Jain; Arun Sharma · 2001