On string replacement exponentiation

DOI10.1023/A:1011212615791MaRDI QIDQ5937085zbMATH OpenOpenAlexFDO

Authors L. J. O'Connor

Publication date 19 March 2002

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1011212615791

zbMATH Keywords

exponentiationstring replacementprobability distribution of exponent weights

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• On character searching and replacing
• Bounds on Powers in Strings
• On the cost of interchange rearrangement in strings
• On the Cost of Interchange Rearrangement in Strings
• NUMBER OF OCCURRENCES OF POWERS IN STRINGS
• scientific article; zbMATH DE number 1142928
• Non-Looping String Rewriting
• String matching with involutions
• Factorizing strings into repetitions
• Algorithms for anti-powers in strings

Cited in

(1)

• Minimal weight k-SR representations

This page was built for publication: On string replacement exponentiation

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