LEARNING ONE-COUNTER LANGUAGES IN POLYNOMIAL TIME.

Piotr Berman, Robert Roos

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    33 Scopus citations

    Abstract

    It is demonstrated 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. The learning protocol is based on D. Angluin's concept (1986) of a minimally adequate teacher who can answer membership queries about a concept and provide counterexamples to incorrect hypothesized concepts. It is also demonstrated that the problem of testing DOCAs for equivalence may be solved in polynomial time.

    Original languageEnglish (US)
    Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
    PublisherIEEE
    Pages61-67
    Number of pages7
    ISBN (Print)0818608072, 9780818608070
    DOIs
    StatePublished - Jan 1 1987

    Publication series

    NameAnnual Symposium on Foundations of Computer Science (Proceedings)
    ISSN (Print)0272-5428

    All Science Journal Classification (ASJC) codes

    • Hardware and Architecture

    Fingerprint Dive into the research topics of 'LEARNING ONE-COUNTER LANGUAGES IN POLYNOMIAL TIME.'. Together they form a unique fingerprint.

  • Cite this

    Berman, P., & Roos, R. (1987). LEARNING ONE-COUNTER LANGUAGES IN POLYNOMIAL TIME. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 61-67). (Annual Symposium on Foundations of Computer Science (Proceedings)). IEEE. https://doi.org/10.1109/sfcs.1987.36