On some properties of the language of 2-collapsing words

Authors:
E. V. Pribavkina
Affiliations:
Ural State University, Ekaterinburg, Russia
Venue:
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Year:
2005

Citing 3
Cited 3

Collapsing Words vs. Synchronizing Words

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Image reducing words and subgroups of free groups

Theoretical Computer Science - WORDS
An inverse automata algorithm for recognizing 2-collapsing words

DLT'02 Proceedings of the 6th international conference on Developments in language theory

2-Synchronizing Words

Language and Automata Theory and Applications
Collapsing words, permutation conditions and coherent colorings of trees

Theoretical Computer Science
A combinatorial approach to collapsing words

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.