Discontinuities in pattern inference (Q924176)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Discontinuities in pattern inference	scientific article

Statements

scholarly article

Discontinuities in pattern inference (English)

Daniel Reidenbach

Theoretical Computer Science

publication date

28 May 2008

full work available at URL

https://figshare.com/articles/Discontinuities_in_pattern_inference/9401606

zbMATH Keywords

pattern languages

inductive inference

telltales

combinatorics on words

morphisms

ambiguity

MaRDI profile type

MaRDI publication profile

Finding patterns common to a set of strings

Inductive inference of formal languages from positive data

The synthesis of language learners.

Finding a homomorphism between two words is NP-complete

UNAMBIGUOUS MORPHIC IMAGES OF STRINGS

Language identification in the limit

Fixed languages and the adult languages of ol schemest<sup>†</sup>

Pattern languages with and without erasing

Decision problems for patterns

Polynomial-time inference of arbitrary pattern languages

Formal language identification: query learning vs. gold-style learning

Relations between Gold-style learning and query learning

Strongly prime PCP words

Finite degrees of ambiguity in pattern languages

On the equivalence problem for E-pattern languages

Developments in Language Theory

Learning Theory

A non-learnable class of E-pattern languages

An average-case optimal one-variable pattern language learner

Stochastic finite learning of the pattern languages

Ignoring data may be the only way to learn efficiently

Identifiers

zbMATH Open document ID

Mathematics Subject Classification ID

zbMATH DE Number

10.1016/J.TCS.2008.02.029

Sitelinks

Mathematics(1 entry)

mardi Publication:924176

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q924176&oldid=38534196"