3 edition of ContextFree Languages and Primitive Words found in the catalog.
|Statement||World Scientific Publishing Company|
|Publishers||World Scientific Publishing Company|
|The Physical Object|
|Pagination||xvi, 95 p. :|
|Number of Pages||57|
nodata File Size: 9MB.
1478-2004USA, and the Hungarian National Foundation for Scientific Research OTKA T049409. eds Language and Automata Theory and Applications. Next article in issue This paper was accepted for the special issue devoted to the 11th Symposium on Theoretical Aspects of Computer Science STACS '94 Theoretical Computer Science 148 2but could not be included in that issue.
A word is primitive if it is not a proper power of a shorter word.
Several examples of such unavoidabilities are presented. Supported by the ESPRIT Basic Research Action WG 6317: Algebraic and Syntactic Methods in Computer Science ASMICS 2. 2004 Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages. We define primitive words as words having only a trivial representation as the power of another word. With this survey article we give an overview about relevant research to this topic during the last twenty years including own investigations and some new results.
Lecture Notes in Computer Science, vol 3113. Cite this paper as: Leupold P. L04710the Xerox ContextFree Languages and Primitive Words UAC Grant no. Publisher Name Springer, Berlin, Heidelberg• 259 Downloads Part of the book series LNCS, volume 3113 Abstract In this note we investigate the languages obtained by intersecting slender regular or context-free languages with the set of all primitive words over the common alphabet.
The most interesting one is that the set of primitive words is unavoidable for context-free languages that are not linear. The set of all roots of nonempty words of a language is called the root of the language.
ContextFree Languages and Primitive Words Primitive Words Are Unavoidable for Context-Free Languages. It is also shown that the language of primitive words that are not del-robust is not context-free. We prove that the set Q of primitive words over an alphabet is not an unambiguous context-free language. 758 Downloads Part of the book series LNCS, volume 6031 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.
We prove that these languages are also regular and, respectively, context-free. Section 7 is dedicated to several generalizations of the notions of periodicity and primitivity of words.
arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. We characterize a class of primitive words, referred as del-robust primitive words, which remain primitive on deletion of any letter. Further we show that the same holds for the set L of Lyndon words.
We consider slender languages, that is, languages for which the number of words of the same length is bounded from above by a constant.
Research Group on Mathematical Linguistics Universitat Rovira i Virgili Tarragona Spain• This strengthens the previous result that Q cannot be deterministic context-free.
We characterize a class of primitive words, referred as del-robust primitive words, which remain primitive on deletion of any letter.