OrDB
Paper
  Data
Lang KJ (1992)
Random DFAs can be approximately learned from sparse uniform examples
45
52
ACM
1992
Proceedings of the Fifth ACM Workshop on Computational Learning Theory
Other categories referring to Lang KJ (1992)
Paper.References   (2)
Revisions: 1
Last Time: 7/24/2006 11:26:32 AM
Reviewer: System Administrator
Owner: System Administrator