An algorithm for recognition of n-collapsing words

Authors:
I. V. Petrov
Affiliations:
Department of Mathematics and Mechanics, Ural State University, 620083 Ekaterinburg, Russia
Venue:
Theoretical Computer Science
Year:
2008

Citing 3
Cited 1

Aspects of classical language theory

Handbook of formal languages, vol. 1
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

Collapsing words, permutation conditions and coherent colorings of trees

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

A word w over a finite alphabet @S is n-collapsing if for an arbitrary deterministic finite automaton A=, the inequality |@d(Q,w)|@?|Q|-n holds provided that |@d(Q,u)|@?|Q|-n for some word u@?@S^+ (depending on A). We prove that the property of n-collapsing is algorithmically recognizable for any given positive integer n. We also prove that the language of all n-collapsing words is context-sensitive.