Regular patterns, regular languages and context-free languages

In this paper we consider two questions. First we consider whether every pattern language which is regular can be generated by a regular pattern. We show that this is indeed the case for extended (erasing) pattern languages if alphabet size is at least four. In all other cases, we show that there are patterns generating a regular language which cannot be generated by a regular pattern. Next we consider whether there are pattern languages which are context-free but not regular. We show that, for alphabet size 2 and 3, there are both erasing and non-erasing pattern languages which are context-free but not regular. On the other hand, for alphabet size at least 4, every erasing pattern language which is context-free is also regular. It is open at present whether there exist non-erasing pattern languages which are context-free but not regular for alphabet size at least 4.

[1]  Takeshi Shinohara,et al.  Polynomial Time Inference of Extended Regular Pattern Languages , 1983, RIMS Symposium on Software Science and Engineering.

[2]  Dominik D. Freydenberger,et al.  Bad News on Decision Problems for Patterns , 2008, Developments in Language Theory.

[3]  Rolf Wiehagen,et al.  Polynomial-time inference of arbitrary pattern languages , 2009, New Generation Computing.

[4]  Daniel Reidenbach,et al.  A non-learnable class of E-pattern languages , 2006, Theor. Comput. Sci..

[5]  Thomas Zeugmann,et al.  Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time , 1995, Annals of Mathematics and Artificial Intelligence.

[6]  Thomas Zeugmann,et al.  Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data , 1998, ICGI.

[7]  Daniel Reidenbach.  The ambiguity of morphisms in free monoids and its impact on algorithmic properties of pattern languages , 2006, Ausgezeichnete Informatikdissertationen.

[8]  Leonard Pitt,et al.  A polynomial-time algorithm for learning k-variable pattern languages from examples , 1989, COLT '89.

[9]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[10]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[11]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[12]  Thomas Erlebach,et al.  Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries , 2001, Theor. Comput. Sci..

[13]  Setsuo Arikawa,et al.  Pattern Inference , 1995, GOSLER Final Report.

[14]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .