Unavoidable languages: cuts and innocent sets of words

被引:0
|
作者
Univ. Paris-VII, lab. informatique, theorique programmation, 75251 Paris, France [1 ]
机构
来源
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] UNAVOIDABLE LANGUAGES, CUTS AND INNOCENT SETS OF WORDS
    ROSAZ, L
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1995, 29 (05): : 339 - 382
  • [2] Unavoidable and almost unavoidable sets of words
    Bell, JP
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2005, 15 (04) : 717 - 724
  • [3] Unavoidable Sets of Partial Words
    Blanchet-Sadri, F.
    Brownstein, N. C.
    Kalcic, Andy
    Palumbo, Justin
    Weyand, T.
    THEORY OF COMPUTING SYSTEMS, 2009, 45 (02) : 381 - 406
  • [4] Unavoidable Sets of Partial Words
    F. Blanchet-Sadri
    N. C. Brownstein
    Andy Kalcic
    Justin Palumbo
    T. Weyand
    Theory of Computing Systems, 2009, 45 : 381 - 406
  • [5] Unavoidable sets and circular splicing languages
    De Felice, Clelia
    Zaccagnino, Rocco
    Zizza, Rosalba
    THEORETICAL COMPUTER SCIENCE, 2017, 658 : 148 - 158
  • [6] THE LENGTH OF SHORT WORDS IN UNAVOIDABLE SETS
    Higgins, Peter M.
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2011, 21 (06) : 951 - 960
  • [7] Unavoidable sets of words of uniform length
    Saker, CJ
    Higgins, PM
    INFORMATION AND COMPUTATION, 2002, 173 (02) : 222 - 226
  • [8] Unavoidable Sets of Partial Words of Uniform Length
    Becker, Joey
    Blanchet-Sadri, F.
    Flapan, Laure
    Watkins, Stephen
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2017, (252): : 26 - 40
  • [9] Two element unavoidable sets of partial words
    Blanchet-Sadri, F.
    Brownstein, N. C.
    Palumbo, Justin
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2007, 4588 : 96 - +
  • [10] AN OPTIMAL TEST ON FINITE UNAVOIDABLE SETS OF WORDS
    CROCHEMORE, M
    LEREST, M
    WENDER, P
    INFORMATION PROCESSING LETTERS, 1983, 16 (04) : 179 - 180