Efficient learning of typical finite automata from random walks

Yoav Freund; Michael Keams; Dana Ron; Ronitt Rubinfeld; Robert E. Schapire; Linda Sellie

doi:10.1145/167088.167191

Efficient learning of typical finite automata from random walks

Yoav Freund, Michael Keams, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English (US)
Title of host publication	Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993
Publisher	Association for Computing Machinery
Pages	315-324
Number of pages	10
ISBN (Electronic)	0897915917
DOIs	https://doi.org/10.1145/167088.167191
State	Published - Jun 1 1993
Externally published	Yes
Event	25th Annual ACM Symposium on Theory of Computing, STOC 1993 - San Diego, United States Duration: May 16 1993 → May 18 1993

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
Volume	Part F129585
ISSN (Print)	0737-8017

Other

Other	25th Annual ACM Symposium on Theory of Computing, STOC 1993
Country/Territory	United States
City	San Diego
Period	5/16/93 → 5/18/93

All Science Journal Classification (ASJC) codes

Software

Access to Document

10.1145/167088.167191

Cite this

Freund, Y., Keams, M., Ron, D., Rubinfeld, R., Schapire, R. E., & Sellie, L. (1993). Efficient learning of typical finite automata from random walks. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993 (pp. 315-324). (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129585). Association for Computing Machinery. https://doi.org/10.1145/167088.167191

@inproceedings{9e3cef6472e6437f9de56e934ce6ae2c,

title = "Efficient learning of typical finite automata from random walks",

author = "Yoav Freund and Michael Keams and Dana Ron and Ronitt Rubinfeld and Schapire, {Robert E.} and Linda Sellie",

year = "1993",

month = jun,

day = "1",

doi = "10.1145/167088.167191",

language = "English (US)",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "315--324",

booktitle = "Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993",

note = "25th Annual ACM Symposium on Theory of Computing, STOC 1993 ; Conference date: 16-05-1993 Through 18-05-1993",

}

Freund, Y, Keams, M, Ron, D, Rubinfeld, R, Schapire, RE & Sellie, L 1993, Efficient learning of typical finite automata from random walks. in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F129585, Association for Computing Machinery, pp. 315-324, 25th Annual ACM Symposium on Theory of Computing, STOC 1993, San Diego, United States, 5/16/93. https://doi.org/10.1145/167088.167191

Efficient learning of typical finite automata from random walks. / Freund, Yoav; Keams, Michael; Ron, Dana et al.
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Association for Computing Machinery, 1993. p. 315-324 (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129585).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Efficient learning of typical finite automata from random walks

AU - Freund, Yoav

AU - Keams, Michael

AU - Ron, Dana

AU - Rubinfeld, Ronitt

AU - Schapire, Robert E.

AU - Sellie, Linda

PY - 1993/6/1

Y1 - 1993/6/1

UR - http://www.scopus.com/inward/record.url?scp=0027307379&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027307379&partnerID=8YFLogxK

U2 - 10.1145/167088.167191

DO - 10.1145/167088.167191

M3 - Conference contribution

AN - SCOPUS:0027307379

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 315

EP - 324

BT - Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993

PB - Association for Computing Machinery

T2 - 25th Annual ACM Symposium on Theory of Computing, STOC 1993

Y2 - 16 May 1993 through 18 May 1993

ER -

Efficient learning of typical finite automata from random walks

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this