Learning two-tape automata from queries and counterexamples

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

1 Citation (Scopus)

Abstract

We investigate the learning problem of two-tape deterministic finite automata (2-tape DFAs) from queries and counterexamples. Instead of accepting a subset of Σ*, a 2-tape DFA over an alphabet Σ accepts a subset of Σ*×Σ*, and therefore, it can specify a binary relation on Σ*. In Angluin showed that the class of deterministic finite automata (DFAs) is learnable in polynomial time from membership queries and equivalence queries, namely, from minimally adequate teacher (MAT). In this article we show that the class of 2-tape DFAs is learnable in polynomial time from MAT in the following sense that there effectively exists an algorithm that, given any language L accepted by an unknown 2-tape DFA M, learns from MAT a two-tape nondeterministic finite automaton (2-tape NFA) M′ accepting L in time polynomial in n and l, where n is the size of M for L and l is the maximum length of any counterexample provided during the learning process. This gives a generalization of the corresponding Angluin's result for DFAs.

Original languageEnglish
Title of host publicationProc 6 Annu ACM Conf Comput Learn Theory
Editors Anon
Place of PublicationNew York, NY, United States
PublisherPubl by ACM
Pages228-235
Number of pages8
ISBN (Print)0897916115
Publication statusPublished - 1993
Externally publishedYes
EventProceedings of the 6th Annual ACM Conference on Computational Learning Theory - Santa Cruz, CA, USA
Duration: 1993 Jul 261993 Jul 28

Other

OtherProceedings of the 6th Annual ACM Conference on Computational Learning Theory
CitySanta Cruz, CA, USA
Period93/7/2693/7/28

Fingerprint

Finite automata
Tapes
Polynomials

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Yokomori, T. (1993). Learning two-tape automata from queries and counterexamples. In Anon (Ed.), Proc 6 Annu ACM Conf Comput Learn Theory (pp. 228-235). New York, NY, United States: Publ by ACM.

Learning two-tape automata from queries and counterexamples. / Yokomori, Takashi.

Proc 6 Annu ACM Conf Comput Learn Theory. ed. / Anon. New York, NY, United States : Publ by ACM, 1993. p. 228-235.

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

Yokomori, T 1993, Learning two-tape automata from queries and counterexamples. in Anon (ed.), Proc 6 Annu ACM Conf Comput Learn Theory. Publ by ACM, New York, NY, United States, pp. 228-235, Proceedings of the 6th Annual ACM Conference on Computational Learning Theory, Santa Cruz, CA, USA, 93/7/26.
Yokomori T. Learning two-tape automata from queries and counterexamples. In Anon, editor, Proc 6 Annu ACM Conf Comput Learn Theory. New York, NY, United States: Publ by ACM. 1993. p. 228-235
Yokomori, Takashi. / Learning two-tape automata from queries and counterexamples. Proc 6 Annu ACM Conf Comput Learn Theory. editor / Anon. New York, NY, United States : Publ by ACM, 1993. pp. 228-235
@inproceedings{93d2e408f5f54286b57abc47bad04f93,
title = "Learning two-tape automata from queries and counterexamples",
abstract = "We investigate the learning problem of two-tape deterministic finite automata (2-tape DFAs) from queries and counterexamples. Instead of accepting a subset of Σ*, a 2-tape DFA over an alphabet Σ accepts a subset of Σ*×Σ*, and therefore, it can specify a binary relation on Σ*. In Angluin showed that the class of deterministic finite automata (DFAs) is learnable in polynomial time from membership queries and equivalence queries, namely, from minimally adequate teacher (MAT). In this article we show that the class of 2-tape DFAs is learnable in polynomial time from MAT in the following sense that there effectively exists an algorithm that, given any language L accepted by an unknown 2-tape DFA M, learns from MAT a two-tape nondeterministic finite automaton (2-tape NFA) M′ accepting L in time polynomial in n and l, where n is the size of M for L and l is the maximum length of any counterexample provided during the learning process. This gives a generalization of the corresponding Angluin's result for DFAs.",
author = "Takashi Yokomori",
year = "1993",
language = "English",
isbn = "0897916115",
pages = "228--235",
editor = "Anon",
booktitle = "Proc 6 Annu ACM Conf Comput Learn Theory",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Learning two-tape automata from queries and counterexamples

AU - Yokomori, Takashi

PY - 1993

Y1 - 1993

N2 - We investigate the learning problem of two-tape deterministic finite automata (2-tape DFAs) from queries and counterexamples. Instead of accepting a subset of Σ*, a 2-tape DFA over an alphabet Σ accepts a subset of Σ*×Σ*, and therefore, it can specify a binary relation on Σ*. In Angluin showed that the class of deterministic finite automata (DFAs) is learnable in polynomial time from membership queries and equivalence queries, namely, from minimally adequate teacher (MAT). In this article we show that the class of 2-tape DFAs is learnable in polynomial time from MAT in the following sense that there effectively exists an algorithm that, given any language L accepted by an unknown 2-tape DFA M, learns from MAT a two-tape nondeterministic finite automaton (2-tape NFA) M′ accepting L in time polynomial in n and l, where n is the size of M for L and l is the maximum length of any counterexample provided during the learning process. This gives a generalization of the corresponding Angluin's result for DFAs.

AB - We investigate the learning problem of two-tape deterministic finite automata (2-tape DFAs) from queries and counterexamples. Instead of accepting a subset of Σ*, a 2-tape DFA over an alphabet Σ accepts a subset of Σ*×Σ*, and therefore, it can specify a binary relation on Σ*. In Angluin showed that the class of deterministic finite automata (DFAs) is learnable in polynomial time from membership queries and equivalence queries, namely, from minimally adequate teacher (MAT). In this article we show that the class of 2-tape DFAs is learnable in polynomial time from MAT in the following sense that there effectively exists an algorithm that, given any language L accepted by an unknown 2-tape DFA M, learns from MAT a two-tape nondeterministic finite automaton (2-tape NFA) M′ accepting L in time polynomial in n and l, where n is the size of M for L and l is the maximum length of any counterexample provided during the learning process. This gives a generalization of the corresponding Angluin's result for DFAs.

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

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

M3 - Conference contribution

SN - 0897916115

SP - 228

EP - 235

BT - Proc 6 Annu ACM Conf Comput Learn Theory

A2 - Anon, null

PB - Publ by ACM

CY - New York, NY, United States

ER -