Cyclic Permutations of Letters of Words in Languages over an Alphabet

References

• Eilenberg , S. 1974 . Automata, Languages and Machines , Vol. A , New York : Academic Press .
   Google Scholar
• Ginsburg , S. 1966 . The Mathematical Theory of Context-Free Languages , New York : McGraw-Hill Book Company .
   Google Scholar
• Haines , L.H. 1969 . On Free Monoids Partially Ordered by Embedding . Journal of Combinatorial Theory , 6 : 94 – 98 .
   Google Scholar
• Oshiba , T. 1972 . On Permuting Letters of Words in Context-free Languages . Information and Control , 20 : 405 – 409 .
   Google Scholar
• Petrich , M. 1963 . Introduction to Semigroups , Columbus : Charles E. Merrill Publishing Co. .
   Google Scholar
• Ruohonen , K. 1977 . On Circular Words and (ω* + ω) – Powers of Words . Elektronische Informationsverabeitung und Kybernetik EIK , 13 : 3 – 12 .
   Google Scholar
• Salomaa , A. 1973 . Formal Languages , New York : Academic Press .
   Google Scholar
• Thierrin , G. 1957 . Contribution a la theorie des anneauxet des demigroupes . Comment Math. Helv. , 32 : 33 – 112 .
   Google Scholar