Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
<i>l</i>-occurrences of avoidable patterns

l-occurrences of avoidable patterns

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 480/1991
BookSTACS 91
DOI10.1007/BFb0020782
Copyright1991
ISBN978-3-540-53709-0
CategoryAutomata And Formal Languages
DOI10.1007/BFb0020786
Pages42-49
Subject CollectionComputer Science
SpringerLink DateMonday, April 10, 2006
Add to marked items

Automata And Formal Languages

l-occurrences of avoidable patterns

Peter Roth1

(1)  Fachbereich Informatik, Johann Wolfgang Goethe-Universität, D - 6000 Frankfurt am Main, Federal Republic of Germany
Abstract
In this paper the concept of l-occurrences of patterns is introduced. Given a word wisinSgr*, we say that w contains a l-occurrence of a pattern pisinE* iff there exists a morphism h : E*rarrSgr* such that h(p) is a factor of w and |h(a)|gel for all aisinSgr.
We prove that a pattern p is avoidable iff there exists an infinite binary word that contains no l-occurrence of p for some l.
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.110 • Server: mpweb18
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)