Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/24634

Title: Revisiting Shinohara's algorithm for computing descriptive patterns
Authors: Fernau, Henning
Manea, Florin
Mercas, Robert
Schmid, Markus L.
Keywords: Pattern languages
Inductive inference
Descriptive patterns
N P-hard problems 2010 MSC: 68Q25, 68Q17, 68Q32
Issue Date: 2017
Publisher: © Elsevier
Citation: FERNAU, H. ... et al, 2017. Revisiting Shinohara's algorithm for computing descriptive patterns. Theoretical Computer Science, 733, pp.44-54.
Abstract: 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 of words, i.e., its pattern language contains S in the closest possible way among all pattern languages. We generalise Shinohara’s algorithm to subclasses of patterns and characterise those subclasses for which it is applicable. Furthermore, within this set of pattern classes, we characterise those for which Shinohara’s algorithm has a polynomial running time (under the assumption P 6= N P). Moreover, we also investigate the complexity of the consistency problem of patterns, i.e., finding a pattern that separates two given finite sets of words.
Description: This paper is closed access until 25 May 2019.
Sponsor: The work of Florin Manea was supported by by DFG grant number 596676. The work of Robert Mercas was supported by the P.R.I.M.E. programme of DAAD with funds provided by the Federal Ministry of Education and Research (BMBF) and the European Unions Seventh Framework Programme for research, technological development and demonstration (grant agreement no. 605728).
Version: Accepted for publication
DOI: 10.1016/j.tcs.2018.04.035
URI: https://dspace.lboro.ac.uk/2134/24634
Publisher Link: https://doi.org/10.1016/j.tcs.2018.04.035
ISSN: 0304-3975
Appears in Collections:Closed Access (Computer Science)

Files associated with this item:

File Description SizeFormat
descriptive_patterns_TCS_Learning_Complexity.pdfAccepted version422.17 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.