SIGN IN
SIGN UP
Inference of finite automata using homing sequences
Full Text:
PDF
Buy this Article
Authors:
R. L. Rivest
MIT Laboratory for Computer Science, Cambridge, MA
R. E. Schapire
MIT Laboratory for Computer Science, Cambridge, MA
Published in:
· Proceeding
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Pages 411-420
ACM
New York, NY
, USA
©1989
table of contents
ISBN:0-89791-307-8
doi>
10.1145/73007.73047
1989 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 19
· Downloads (cumulative): 794
· Citation Count: 33
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
experimentation
permutations and combinations
theory
unbounded-action devices
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder