An optimal parallel algorithm for learning DFA

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: José L. Balcázar Department of Software (L.S.I.), Univ. Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain
Josep Díaz Department of Software (L.S.I.), Univ. Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain
Ricard Gavaldà Department of Software (L.S.I.), Univ. Politècnica de Catalunya, Pau Gargallo 5, 08028 Barcelona, Spain
Osamu Watanabe Department of Computer Science, Tokyo Institute of Technology, Meguro-ku, Tokyo 152, Japan
An optimal parallel algorithm for learning DFA Published by ACM 1994 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 7
· Downloads (cumulative): 227
· Citation Count: 6

Published in:
Cover Image
 
· Proceeding
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Pages 208-217
ACM New York, NY, USA ©1994
table of contents ISBN:0-89791-655-7 doi>10.1145/180139.181110

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder