Existence and nonexistence of descriptive patterns

DOI10.1016/J.TCS.2010.05.033zbMath1195.68056OpenAlexW1643410239MaRDI QIDQ986561

Daniel Reidenbach, Dominik D. Freydenberger

Publication date: 11 August 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.033

zbMATH Keywords

pattern languagesdescriptive patterns

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Fast learning of restricted regular expressions and dtds ⋮ Revisiting Shinohara's algorithm for computing descriptive patterns ⋮ Inferring descriptive generalisations of formal languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a homomorphism between two words is NP-complete
• Developments from enquiries into the learnability of the pattern languages from positive data
• Morphically primitive words
• Bad news on decision problems for patterns
• Finding patterns common to a set of strings
• Decision problems for patterns
• Existence and Nonexistence of Descriptive Patterns
• Pattern languages with and without erasing

This page was built for publication: Existence and nonexistence of descriptive patterns