no. 3-4
Finite degrees of ambiguity in pattern languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) no. 3-4, pp. 233-253. 
@article{ITA_1994__28_3-4_233_0,
     author = {Mateescu, A. and Salomaa, A.},
     title = {Finite degrees of ambiguity in pattern languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {233--253},
     publisher = {EDP-Sciences},
     volume = {28},
     number = {3-4},
     year = {1994},
     mrnumber = {1282446},
     zbl = {0883.68076},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1994__28_3-4_233_0/}
}
TY  - JOUR
AU  - Mateescu, A.
AU  - Salomaa, A.
TI  - Finite degrees of ambiguity in pattern languages
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1994
SP  - 233
EP  - 253
VL  - 28
IS  - 3-4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1994__28_3-4_233_0/
LA  - en
ID  - ITA_1994__28_3-4_233_0
ER  - 
%0 Journal Article
%A Mateescu, A.
%A Salomaa, A.
%T Finite degrees of ambiguity in pattern languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1994
%P 233-253
%V 28
%N 3-4
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1994__28_3-4_233_0/
%G en
%F ITA_1994__28_3-4_233_0
Mateescu, A.; Salomaa, A. Finite degrees of ambiguity in pattern languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) no. 3-4, pp. 233-253. http://archive.numdam.org/item/ITA_1994__28_3-4_233_0/

1. D. Angluin, Finding patterns common to a set of strings, Journal of Computer and System Sciences, 1980, 21, pp. 46-62. | MR | Zbl

2. J. Bean, A. Ehrenfeucht, and G. Mcnulty, Avoidable patterns in strings of symbols, Pacific Journal of Mathematics, 1979, 85, pp. 261-294. | MR | Zbl

3. J. Cassaigne, Unavoidable binary patterns, Acta Informatica, 1993, 30, pp. 385-395. | MR | Zbl

4. K. Culik Ii and J. Karhumäki, Systems of equations over a free monoid and Ehrenfeucht's conjecture, Discrete Mathematics, 1983, 43, pp. 139-153. | MR | Zbl

5. T. Jiang, E. Kinber, A. Salomaa, K. Salomaa and S. Yu, Pattern languages with and without erasing, to appear in International Journal of Computer Mathematics. | Zbl

6. T. Jiang, A. Salomaa, K. Salomaa and S. Yu, Inclusion is undecidable for pattern languages, ICALP-93 Proceedings, Springer Lecture Notes in Computer Science, 1993, 700, pp. 301-312.

7. V. Keränen, Abelian squares can be avoided on four letters, Springer Lecture Notes in Computer Science, 1992, 623, pp. 41-52. | MR

8. G. Kucherov, M. Rusinowitch, On ground reducibility problem for word rewriting Systems with variables, Centre de Recherche en Informatique de Nancy, Report CRIN 93-R-012.

9. G. S. Makanin, The problem of solvability of equations in a free semigroup (in Russian), Matematiceskij Sbornik, 1977, 103, 145, pp. 148-236. | MR | Zbl

10. A. Salomaa, Formal Languages, Academic Press, 1973. | MR | Zbl

11. A. Thue, Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Kristiania, 1906, 7, pp. 1-22. | JFM