Revisiting Shinohara's algorithm for computing descriptive patterns

A pattern α is a word consisting of constants and variables and it describes the pattern language L(α) of all words that can be obtained by uniformly replacing the variables with constant words. In 1982, Shinohara presents an algorithm that computes a pattern that is descriptive for a finite set S o...

Full description

Saved in:
Bibliographic Details
Main Authors: Henning Fernau, Florin Manea, Robert Mercas, Markus L. Schmid
Format: Default Article
Published: 2018
Subjects:
Other information and computing sciences not elsewhere classified
Pattern languages
Inductive inference
Descriptive patterns
N P-hard problems 2010 MSC: 68Q25, 68Q17, 68Q32
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/24634
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/24634

Similar Items