On shortest crucial words avoiding abelian powers-Reference-Cited by-同舟云学术

On shortest crucial words avoiding abelian powers

Published:2010-03 Issue:6 Volume:158 Page:605-607
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Avgustinovich Sergey,Glen Amy,Halldórsson Bjarni V.,Kitaev Sergey

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference3 articles.

1. Some unsolved problems;Erdős;Magyar Tud. Akad. Mat. Kut. Int. Kozl.,1961

2. Crucial words and the complexity of some extremal problems for sets of prohibited words;Evdokimov;J. Combin. Theory Ser. A,2004

3. A. Glen, B.V. Halldórsson, S. Kitaev, Crucial words for abelian powers, in: Proceedings of the 13th International Conference on Developments in Language Theory, DLT 2009, Stuttgart, Germany, June 30–July 3, 2009

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

1. Fast algorithms for Abelian periods in words and greatest common divisor queries;Journal of Computer and System Sciences;2017-03

2. Abelian periods, partial words, and an extension of a theorem of Fine and Wilf;RAIRO - Theoretical Informatics and Applications;2013-04-25

3. A note on efficient computation of all Abelian periods in a string;Information Processing Letters;2013-02

4. Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet;Lecture Notes in Computer Science;2013

5. IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS;International Journal of Foundations of Computer Science;2012-09