Communications of the ACM
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On the learnability of Boolean formulae
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Learning disjunction of conjunctions
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Deterministic one-counter automata
Journal of Computer and System Sciences
Synthesis of real time acceptors
Journal of Symbolic Computation - Special issue on automatic programming
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
Efficient learning of context-free grammars from positive structural examples
Information and Computation
Generalizing over several learning settings
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Language equivalence of deterministic real-time one-counter automata is NL-complete
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Minimization, learning, and conformance testing of boolean programs
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Learning Via Queries With Teams And Anomalies
Fundamenta Informaticae
Equivalence of deterministic one-counter automata is NL-complete
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We demonstrate that the class of languages accepted by deterministic one-counter machines, or DOCAs (a natural subset of the context-free languages), is learnable in polynomial time. Our learning protocol is based upon Angluin's concept of a "minimally adequate teacher" who can answer membership queries about a concept and provide counterexamples to incorrect hypothesized concepts. We also demonstrate that the problem of testing DOCAs for equivalence may be solved in polynomial time, answering a question posed by Valiant and Paterson.