Affiliation:
1. Department of Mathematics and Mechanics, Ural State University, 620083 Ekaterinburg, Russia
Abstract
We present two new results on 2-collapsing words. First, we show that the language of all 2-collapsing words over 2 letters is not context-free. Second, we prove that the length of a 2-collapsing word over an arbitrary finite alphabet Σ is at least 2|Σ|2 thus improving the previously known lower bound |Σ|2 + 1.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献