Article

Free access

Exactly learning automata with small cover time

Authors:

Dana Ron,

Ronitt RubinfeldAuthors Info & Claims

COLT '95: Proceedings of the eighth annual conference on Computational learning theory

Pages 427 - 436

https://doi.org/10.1145/225298.225350

Published: 05 July 1995 Publication History

PDF eReader

References

[1]

Dana Angluin. A note on the number of queries needed to identify regular languages. Information and Control, 51:76-87, 1981.

Crossref

Google Scholar

[2]

Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, November 1987.

Digital Library

Google Scholar

[3]

Dana Angluin and Philip Laird. Learning from noisy examples. Machine Learning, 2(4):343-370, 1988.

Digital Library

Google Scholar

[4]

Michael Bender and Donna Slonim. The power of team exploration: Two robots can learn unlabeled directed graphs. In Proceedings of the Thr~ty Fifth Annual Symposium on Foundations of Computer Science, pages 75-85, 1994.

Digital Library

Google Scholar

[5]

Thomas Dean, Dana Angluin, Kenneth Basye, Sean Engelson, Leslie Kaelbling, Evangelos Kokkevis, and Oded Maron. Inferring finite automata with stochastic output functions and an application to map learning. Machine Learning, 18(1):81-108, January 1995.

Digital Library

Google Scholar

[6]

L. Fortnow and D. Whang. Optimality and domination in repeated games with bounded players. In The 25th Annual ACM Symposium on Theory of Computing, pages 741-749, 1994.

Digital Library

Google Scholar

[7]

Michael Frazier, Sally Goldman, Nina Mishra, and Leonard Pitt. Learning from a consistently ignorant teacher. In Proceedings o/the Seventh Annual A CM Conference on Computational Learning Theory, pages 328-339, 1994.

Digital Library

Google Scholar

[8]

Yoav Freund, Michael J. Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, and Linda Sellie. Efficient learning of typical finite automata from random walks. In Proceedings of the 2dth Annual ACM Symposium on Theory of Computing, 1993.

Digital Library

Google Scholar

[9]

I. Gilboa and D. Samet. Bounded versus unbounded rationality: The tyranny of the weak. Games and Economic Behavior, 1(3):213-221, 1989.

Crossref

Google Scholar

[10]

Wassily Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13- 30, March 1963.

Crossref

Google Scholar

[11]

Michael Kearns and Leslie G. Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. Journal of the Association /or Computing Machinery, 41:67-95, 1994. An extended abstract of this paper appeared in STOC89.

Digital Library

Google Scholar

[12]

Zvi Kohavi. Switching and Finite Automata Theory. McGraw-Hill, second edition, 1978.

Digital Library

Google Scholar

[13]

Leonard Pitt and Manfred K. Warmuth. Prediction-preserving reducibility. Journal o/Computer and System Sciences, 41(3):430-467, December 1990.

Digital Library

Google Scholar

[14]

Ronald. L. Riv~st and Robert. E. Sehapira. Inference of finite automata using homing sequences. Information and Computation, 103(2):299-347, 1993.

Digital Library

Google Scholar

[15]

Ronald L. Rivest and David Zuckermann. Private communication. 1992.

Google Scholar

[16]

Dana Ron and Ronitt Rubinfeld. Learning fallible finite state automata. In Proceedings of the Sixth Annual A CM Conference on Computational Learning Theory, pages 218-227, 1993. To appear in Machine Learning, COLT '93 special issue.

Digital Library

Google Scholar

[17]

Yasubumi Sakakibara. On learning from queries and couterexamples in the presence of noise. Information Processing Letters, 37:279-284, 1991.

Digital Library

Google Scholar

[18]

Alistair Sinclair and Mark Jerrum. Approximate counting, uniform generation, and rapidly mixing Markov chains. Information and Computation, 82:93-13, 1989.

Digital Library

Google Scholar

Cited By

View all

Carmel DMarkovitch S(1999)Exploration Strategies for Model-based Learning in Multi-agent SystemsAutonomous Agents and Multi-Agent Systems10.1023/A:10100071081962:2(141-172)Online publication date: 1-Jun-1999
https://dl.acm.org/doi/10.1023/A%3A1010007108196
CARMEL DMARKOVITCH S(1998)Model-based learning of interaction strategies in multi-agent systemsJournal of Experimental & Theoretical Artificial Intelligence10.1080/09528139814678910:3(309-332)Online publication date: Jul-1998
https://doi.org/10.1080/095281398146789
Freund YKearns MMansour YRon DRubinfeld RSchapire R(1995)Efficient algorithms for learning to play repeated games against computationally bounded adversariesProceedings of IEEE 36th Annual Foundations of Computer Science10.1109/SFCS.1995.492489(332-341)Online publication date: 1995
https://doi.org/10.1109/SFCS.1995.492489

Index Terms

Exactly learning automata with small cover time

Recommendations

Exactly Learning Automata of Small Cover Time
Special issue on the eighth annual conference on computational learning theory, (COLT '95)

We present algorithms for exactly learning unknown environments that can be described by deterministic finite automata. The learner performs a walk on the target automaton, where at each step it observes the output of the state it is at, and chooses a ...
Minimal cover-automata for finite languages

A cover-automaton A of a finite language L Σ is a finite deterministic automaton (DFA) that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic finite cover automaton (DFCA) of a finite language L ...
Converting nondeterministic two-way automata into small deterministic linear-time machines
Abstract
In 1978 Sakoda and Sipser raised the question of the cost, in terms of size of representations, of the transformation of two-way and one-way nondeterministic automata into equivalent two-way deterministic automata. Despite all the ...

Comments

Information & Contributors

Information

Published In

COLT '95: Proceedings of the eighth annual conference on Computational learning theory

July 1995

464 pages

ISBN:0897917235

DOI:10.1145/225298

Chairman:
Wolfgang Maass
Technische Univ. Graz, Graz, Austria

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 July 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

8COLT95

Sponsor:

SIGAI
University of California
SIGACT

8COLT95: 8th Annual Conference on Computational Learning Theory

July 5 - 8, 1995

California, Santa Cruz, USA

Acceptance Rates

Overall Acceptance Rate 35 of 71 submissions, 49%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
287
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)3

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Carmel DMarkovitch S(1999)Exploration Strategies for Model-based Learning in Multi-agent SystemsAutonomous Agents and Multi-Agent Systems10.1023/A:10100071081962:2(141-172)Online publication date: 1-Jun-1999
https://dl.acm.org/doi/10.1023/A%3A1010007108196
CARMEL DMARKOVITCH S(1998)Model-based learning of interaction strategies in multi-agent systemsJournal of Experimental & Theoretical Artificial Intelligence10.1080/09528139814678910:3(309-332)Online publication date: Jul-1998
https://doi.org/10.1080/095281398146789
Freund YKearns MMansour YRon DRubinfeld RSchapire R(1995)Efficient algorithms for learning to play repeated games against computationally bounded adversariesProceedings of IEEE 36th Annual Foundations of Computer Science10.1109/SFCS.1995.492489(332-341)Online publication date: 1995
https://doi.org/10.1109/SFCS.1995.492489

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Exactly Learning Automata of Small Cover Time

Minimal cover-automata for finite languages

Converting nondeterministic two-way automata into small deterministic linear-time machines

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Exactly Learning Automata of Small Cover Time

Minimal cover-automata for finite languages

Converting nondeterministic two-way automata into small deterministic linear-time machines

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations