Inductive inference of unbounded unions of pattern languages from positive data

Authors: Shinohara T.1; Arimura H.

Source: Theoretical Computer Science, Volume 241, Number 1, 28 June 2000 , pp. 191-209(19)

Publisher: Elsevier

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Language: English

Document Type: Research article

DOI: 10.1016/S0304-3975(99)00270-4

Affiliations: 1: aDepartment of Artificial Intelligence, Kyushu Institute of Technology, 820, Iizuka, Japan

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A