Result: Alternative proof of the Lyndon-Schützenberger Theorem
Title:
Alternative proof of the Lyndon-Schützenberger Theorem
Authors:
Source:
Automata and formal languagesTheoretical computer science. 366(3):194-198
Publisher Information:
Amsterdam: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 13 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Problèmes combinatoires classiques, Classical combinatorial problems, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Traitement des données. Listes et chaînes de caractères, Data processing. List processing. Character string processing, Combinatoire mot, Word combinatorics, Informatique théorique, Computer theory, Informática teórica, Preuve, Solution équation, Combinatorics of words
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Faculty of Informatics, Debrecen University, Egyetem tér I, Debrecen 4032, Hungary
ISSN:
0304-3975
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Mathematics
Mathematics
Accession Number:
edscal.18316923
Database:
PASCAL Archive
Further Information
Some observations on products of primitive words are discussed. By these results, alternative proof is given for the Lyndon-Schützenberger Theorem, which says that every solution of the equation ambn = ck over Σ* is trivial.