Cyclic Permutations of Letters of Words in Languages over an Alphabet

DOI10.1080/02522667.1989.10698974MaRDI QIDQ3833643zbMATH OpenOpenAlexFDO

Authors G. Rubin-Thomas

Publication date 1989

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1989.10698974

zbMATH Keywords

regular languagecyclic permutations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Words over an ordered alphabet and suffix permutations
• A permutation on words in a two letter alphabet
• Aspects of Molecular Computing
• scientific article; zbMATH DE number 475643
• scientific article; zbMATH DE number 3995072
• Cyclically repetition-free words on small alphabets
• Some permutations on Dyck words
• Cyclic complexity of words
• Cyclic Complexity of Words
• scientific article; zbMATH DE number 1380419

Cites work

• scientific article; zbMATH DE number 3501790 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• On free monoids partially ordered by embedding
• On permuting letters of words in context-free languages

Cited in

(1)

• Permutations of context-free, ET0L and indexed languages

This page was built for publication: Cyclic Permutations of Letters of Words in Languages over an Alphabet

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833643)