Context Free Languages And Primitive Words

Author: Pál Dömösi
Publisher: World Scientific
ISBN: 9814616559
Size: 16.51 MB
Format: PDF, Mobi
View: 7183
A word is said to be primitive if it cannot be represented as any power of another word. It is a well-known conjecture that the set of all primitive words Q over a non-trivial alphabet is not context-free: this conjecture is still open. In this book, the authors deal with properties of primitive words over a non-primitive alphabet, the language consisting of all primitive words and related languages. Moreover, some decidable and undecidable problems with respect to the above languages are discussed as well. As another try, a search for a non-phrase structure grammar which generates Q is performed. Contents:PreliminariesCombinatorial Properties of Words and LanguagesRewriting SystemsIteration LemmataOther Characterizations of Context-Free LanguagesBounded and Palindromic LanguagesFurther Combinatorial Investigations on Primitive WordsSome Properties of the Language of Primitive WordsPrimitive Words in LanguagesKászonyi-Katsura TheoryDerivating Primitive WordsDecidability, Roots, MultisetsContext-Free Languages and Non-primitive WordsPrimitive Words and PalindromesMarcus Contextual Grammars and Primitive WordsAppendices Readership: Researchers, lecturers, senior undergraduates and graduate students in theoretical computer science. Keywords:Word;Language;Context-Free;Primitive Word

Fundamentals Of Computation Theory

Author: Zoltan Esik
Publisher: Springer Science & Business Media
ISBN: 9783540571636
Size: 71.37 MB
Format: PDF, Docs
View: 1948
This volume contains the proceedings of the Ninth Conference on Fundamentalsof Computation Theory (FCT 93) held in Szeged, Hungary, in August 1993. The conference was devoted to a broad range of topics including: - Semanticsand logical concepts in the theory of computing and formal specification - Automata and formal languages - Computational geometry, algorithmic aspects of algebra and algebraic geometry, cryptography - Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts) - Algorithms (efficient, probabilistic, parallel, sequential, distributed) - Counting and combinatorics in connection with mathematical computer science The volume contains the texts of 8 invitedlectures and 32 short communications selected by the international program committee from a large number of submitted papers.