simple deterministic languages
Recently Published Documents

TOTAL DOCUMENTS

9

(FIVE YEARS 0)

H-INDEX

4

(FIVE YEARS 0)

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Teachability of a Subclass of Simple Deterministic Languages

IEICE Transactions on Information and Systems ◽

10.1587/transinf.e96.d.2733 ◽

2013 ◽

Vol E96.D (12) ◽

pp. 2733-2742

Author(s):

Yasuhiro TAJIMA

Keyword(s):

Simple Deterministic Languages

Download Full-text

Polynomial time learning of simple deterministic languages via queries and a representative sample

Theoretical Computer Science ◽

10.1016/j.tcs.2004.08.012 ◽

2004 ◽

Vol 329 (1-3) ◽

pp. 203-221 ◽

Author(s):

Yasuhiro Tajima ◽

Etsuji Tomita ◽

Mitsuo Wakatsuki ◽

Matsuaki Terada

Keyword(s):

Polynomial Time ◽

Representative Sample ◽

Polynomial Time Learning ◽

Simple Deterministic Languages

Download Full-text

An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30195-0_31 ◽

2004 ◽

pp. 288-289

Author(s):

Yasuhiro Tajima ◽

Yoshiyuki Kotani ◽

Matsuaki Terada

Keyword(s):

Search Space ◽

Pac Learning ◽

Membership Queries ◽

Simple Deterministic Languages

Download Full-text

A PAC Learnability of Simple Deterministic Languages

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-45790-9_20 ◽

2002 ◽

pp. 249-260

Author(s):

Yasuhiro Tajima ◽

Matsuaki Terada

Keyword(s):

Simple Deterministic Languages

Download Full-text

A Polynomial Time Learning Algorithm of Simple Deterministic Languages via Membership Queries and a Representative Sample

Grammatical Inference: Algorithms and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-540-45257-7_23 ◽

2000 ◽

pp. 284-297 ◽

Author(s):

Yasuhiro Tajima ◽

Etsuji Tomita

Keyword(s):

Polynomial Time ◽

Representative Sample ◽

Learning Algorithm ◽

Membership Queries ◽

Polynomial Time Learning ◽

Simple Deterministic Languages

Download Full-text

Polynomial time learnability of simple deterministic languages

Machine Learning ◽

10.1007/bf00116035 ◽

1990 ◽

Vol 5 (2) ◽

pp. 151-164 ◽

Author(s):

Hiroki Ishizaka

Keyword(s):

Polynomial Time ◽

Simple Deterministic Languages

Download Full-text

LEARNING SIMPLE DETERMINISTIC LANGUAGES

Proceedings of the Second Annual Workshop on Computational Learning Theory ◽

10.1016/b978-0-08-094829-4.50014-3 ◽

1989 ◽

pp. 162-174 ◽

Author(s):

Hiroki Ishizaka

Keyword(s):

Simple Deterministic Languages

Download Full-text

A note on a decomposition theorem for simple deterministic languages

Information and Control ◽

10.1016/s0019-9958(71)90145-8 ◽

1971 ◽

Vol 19 (3) ◽

pp. 272-274 ◽

Author(s):

Akira Fusaoka

Keyword(s):

Decomposition Theorem ◽

Simple Deterministic Languages

Download Full-text

Simple deterministic languages

10.1109/swat.1966.22 ◽

1966 ◽

Author(s):

A. J. Korenjak ◽

J. E. Hopcroft

Keyword(s):

Simple Deterministic Languages

Download Full-text