Primitive words are unavoidable for context-free languages

Authors:
Peter Leupold
Affiliations:
Fachbereich Elektrotechnik/Informatik, Fachgebiet Theoretische Informatik, Universität Kassel, Kassel, Germany
Venue:
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Year:
2010

Citing 6
Cited 0

On a conjecture about slender context-free languages

Theoretical Computer Science
On the language of primitive words

Theoretical Computer Science
Theory of Codes

Theory of Codes
Introduction to Formal Language Theory

Introduction to Formal Language Theory
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages
Roots and powers of regular languages

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the concept of unavoidability of languages with respect to a language class; this means that every language of the given class shares at least some word with the unavoidable language. Several examples of such unavoidabilities are presented. The most interesting one is that the set of primitive words is unavoidable for context-free languages that are not linear.