Regular patterns, regular languages and context-free languages

No abstract is available for this paper.

• Publication year

  2010

• Venue

  Information Processing Letters

• Publication date

  2010-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ipl.2010.09.010
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Bad News on Decision Problems for Patterns

  2008cited by this paper
• The ambiguity of morphisms in free monoids and its impact on algorithmic properties of pattern languages

  2007influential reference
• Introduction to automata theory, languages, and computation, 3rd Edition

  2007cited by this paper
• A non-learnable class of E-pattern languages

  2006influential reference
• Introduction to automata theory, languages, and computation, 2nd edition

  2001cited by this paper
• Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data

  1998cited by this paper
• An Introduction to Kolmogorov Complexity and Its Applications, Third Edition

  1997cited by this paper
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

  1997cited by this paper
• Pattern Inference

  1995cited by this paper
• Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time

  1995cited by this paper
• An Introduction to Kolmogorov Complexity and Its Applications

  1993cited by this paper
• Polynomial-time inference of arbitrary pattern languages

  1991cited by this paper
• A polynomial-time algorithm for learning k-variable pattern languages from examples

  1989cited by this paper
• Polynomial Time Inference of Extended Regular Pattern Languages

  1983influential reference
• Finding Patterns Common to a Set of Strings

  1980influential reference
• Introduction to Automata Theory, Languages and Computation

  1979cited by this paper

• Finitely distinguishable erasing pattern languages

  2020cites this paper
• The teaching complexity of erasing pattern languages with bounded variable frequency

  2019cites this paper
• Erasing Pattern Languages Distinguishable by a Finite Number of Strings

  2017influential citation
• Distinguishing Linear Sets and Pattern Languages With Membership Examples

  2017cites this paper
• Distinguishing pattern languages with membership examples

  2017cites this paper
• Grammatical Inference and Language Frameworks for LANGSEC

  2015cites this paper
• Distinguishing Pattern Languages with Membership Examples

  2014cites this paper
• Closure properties of pattern languages

  2014cites this paper
• Regular and context-free pattern languages over small alphabets

  2012influential citation
• The Complexity of Verbal Languages over Groups

  2012cites this paper
• On the membership problem for pattern languages and related topics

  2012influential citation
• ON AUTOMATIC FAMILIES

  2011cites this paper