Pattern languages with and without erasing

References

• Angluin , D. 1980 . Finding patterns common to a set of strings . J. of Comp. and System Sci. , 21 : 46 – 62 .
   Web of Science ®Google Scholar
• Angluin , D. 1980 . Inductive inference of formal languages from positive data . Information and Control , 45 : 117 – 135 .
   Google Scholar
• Bean , D. R. , Ehrenfeucht , A. and Mcnulty , G. F. 1979 . Avoidable patterns in strings of symbols . Pacific J. Math. , 85 : 261 – 294 .
   Web of Science ®Google Scholar
• Ibarra , O. and Jiang , T. 1991 . Learning regular languages from counterexamples . Journal of Computer and System Sciences , 43 ( 2 ) : 299 – 316 .
   Web of Science ®Google Scholar
• Keränen , V. 1992 . Abelian squares can be avoided on four letters . ICALP-92 Proceedings , 623 ( 2 ) : 41 – 52 . Springer Lecture Notes in Computer Science
   Google Scholar
• Makanin , G. S. 1977 . The problem of solvability of equations in a free semigroup . Soviet Math. Dokl. , 18 ( 2 ) : 330 – 334 .
   Google Scholar
• Salomaa , A. 1973 . Formal Languages , Academic Press .
   Google Scholar
• Tanida , N. and Yokomori , T. 1992 . Polynomial-time identification of strictly regular languages in the limit . IEICE Trans. Inf. and Syst. , E75-D : 125 – 132 .
   Google Scholar
• Thue , A. 1906 . Über unendliche Zeichenreihen . Norske Vid. Selsk. Skr., I Mat. Nat. KL, Christiania , 7 : 1 – 22 .
   Google Scholar