Crucial words and the complexity of some extremal problems for sets of prohibited words-Reference-Cited by-同舟云学术

Crucial words and the complexity of some extremal problems for sets of prohibited words

Published:2004-02 Issue:2 Volume:105 Page:273-289
ISSN:0097-3165
Container-title:Journal of Combinatorial Theory, Series A
language:en
Short-container-title:Journal of Combinatorial Theory, Series A

Author:

Evdokimov A.,Kitaev S.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference20 articles.

1. S.E. Arshon, The Proof of the Existence of n-letter Non-Repeated Asymmetric Sequences, Mathematics Collected Papers, New Series, Vol. 2(3), Publ. H. AS USSR, Moscow, 1937, pp. 769–779 (Russian).

2. Avoidable patterns in strings of symbols;Bean;Pacific J. Math,1979

3. On the number of abelian square-free words on four letters;Carpi;Discrete Appl. Math,1998

4. Some unsolved problems;Erdös;Publ. Math. Inst. Hung. Acad. Sci. Ser. A,1961

5. Strongly asymmetric sequences generated by a finite number of symbols;Evdokimov;Dokl. Akad. Nauk. SSSR,1968

Cited by 79 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cyclic relative difference families with block size four and their applications;Journal of Combinatorial Theory, Series A;2024-08

2. The existence of $$(\mathbb {Z}_v,4,1)$$-disjoint difference families;Designs, Codes and Cryptography;2024-06-20

3. Counting crucial permutations with respect to monotone patterns;Discrete Mathematics;2024-04

4. Creating and Using Minimizer Sketches in Computational Genomics;Journal of Computational Biology;2023-12-01

5. Constructions of optimal two-dimensional optical orthogonal codes with AM-OPPW restriction for λ = 2;Discrete Mathematics;2023-08