EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 29 / No 5 (1995) RAIRO-Theor. Inf. Appl., 29 5 (1995) 339-382 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 29, Number 5, 1995
Page(s) 339 - 382
DOI https://doi.org/10.1051/ita/1995290503391
Published online 01 February 2017
  1. 1. A. V. AHO and M. J. CORASICK, Efficient string machines, an aid to bibliographic research, Comm. ACM, 1975, 18 (6), pp. 333-340. [MR: 371172] [Zbl: 0301.68048] [Google Scholar]
  2. 2. D. R. BEAN, A. EHRENFEUCHT and G. F. MCNULTY, Avoidable patterns in strings of symbols, Pacific J. Math., 1979, 85, 2, pp. 261-294. [MR: 574919] [Zbl: 0428.05001] [Google Scholar]
  3. 3. W. BUCHER, A. EHRENFEUCHT and D. HAUSSLER, On Total Regulators Generated by Derivation Relations, Proc. of 12th International Colloquium on Automata, Languages and Programming; Lectures notes in Computer Science, 194, Springer-Verlag, 1985, pp, 71-79. [MR: 819242] [Zbl: 0571.68056] [Google Scholar]
  4. 4. C. CHOFFRUT and K. CULIK, On extendibility of unavoidable sets, Discrete Applied Mathematics, 1984, pp. 125-137. [MR: 761597] [Zbl: 0629.68080] [Google Scholar]
  5. 5. M. CROCHEMORE, M. LEREST and P. WENDER, An optimal test on finite unavoidable sets of words, Information Processing Letter, 1983, 16, pp. 179-180. [MR: 707587] [Zbl: 0506.68057] [Google Scholar]
  6. 6. A. EHRENFEUCH, D. HAUSSLER and G. ROZENBERG, On regularity of context-free languages, Theor Comp. Sci., 1983, 27, pp. 311-332. [MR: 731068] [Zbl: 0553.68044] [Google Scholar]
  7. 7. N. J. FINE and H. S. WILF, Uniqueness Theorem for Periodic functions, Proc. Am. Math. Soc., 1965, 16, pp. 109-114. [MR: 174934] [Zbl: 0131.30203] [Google Scholar]
  8. 8. G. HIGMAN, Ordering by divisibility in abstract algebras, Proc. London Math. Soc., 1952, 2, pp. 326-336. [MR: 49867] [Zbl: 0047.03402] [Google Scholar]
  9. 9. KRUSKAL, Well-quasi ordering, The Tree Theorem, and Vazsonyi's conjecture, Trans. Amer. Math. Soc., 1960, 95, pp. 210-225. [MR: 111704] [Zbl: 0158.27002] [Google Scholar]
  10. 10. KRUSKAL, The theory of well-quasi ordering: a frequently discovered concept, J. Comb. Theory Ser., 1972, A 13 (3), pp. 297-305. [MR: 306057] [Zbl: 0244.06002] [Google Scholar]
  11. 11. G. KUCHEROV and M. RUSINOVITCH, On Ground-Reducibility Problem for Word Rewriting Systems with Variables, In E. DEATON and R. WILKERSON, eds., Proceedings 1994 ACM/SIGAPP Symposium on Applied Computing, Phoenix, March 1994, ACM-Press. [Google Scholar]
  12. 12. G. KUCHEROV and M. RUSINOVITCH, Complexity of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables, preprint. [Google Scholar]
  13. 13. LOTHAIRE, Combinatorics on words, chapter 1, Add.-Wesley, by D. PERRIN, 1983. [MR: 675953] [Zbl: 0514.20045] [Google Scholar]
  14. 14. ld, chapter 6, by J. SAKAROVITCH. [Google Scholar]
  15. 15. E. OCHMANSKI, Inevitability in concurrent Systems, IPL 25, 1987, pp. 221-225. [MR: 896138] [Zbl: 0653.68011] [Google Scholar]
  16. 16. L. PUEL, Using unavoidable sets of trees to generalize Kruskal's theorem, J.S.C., 1989, Vol. 8, No. 4, pp. 335-382. [MR: 1021611] [Zbl: 0676.06003] [Google Scholar]
  17. 17. L. ROSAZ, Inventories of unavoidable languages and the word-extension conjecture, to appear in Theoretical Computer Science. [MR: 1625403] [Zbl: 0902.68099] [Google Scholar]
  18. 18. L. ROSAZ, Unavoidable languages, Mémoire de thèse, LITP Report. [Google Scholar]
  19. 19. M. P. SCHUTZENBERGER, On the synchronizing properties of certain prefix codes, Information and Control, 1964, 7, pp. 23-36. [MR: 199049] [Zbl: 0122.15004] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.