Unavoidable regularities in long words with bounded number of symbol occurrences

Authors:
Juha Kortelainen;Tuomas Kortelainen;Ari Vesanen
Affiliations:
Department of Information Processing Science, University of Oulu, Oulu, Finland;Mathematics Division, Department of Electrical and Information Engineering, University of Oulu, Oulu, Finland;Department of Information Processing Science, University of Oulu, Oulu, Finland
Venue:
Journal of Combinatorial Optimization
Year:
2013

Citing 12
Cited 0

Some applications of a theorem of Shirshov to language theory

Information and Control
Local and global cyclicity in free semigroups

Theoretical Computer Science
Finiteness and Regularity in Semigroups and Formal Languages

Finiteness and Regularity in Semigroups and Formal Languages
Introduction to Formal Language Theory

Introduction to Formal Language Theory
On highly palindromic words

Discrete Applied Mathematics
Birthday Paradox for Multi-Collisions

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
The Ehrenfeucht-Silberger Problem

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Herding, Second Preimage and Trojan Message Attacks beyond Merkle-Damgård

Selected Areas in Cryptography
Constructing an ideal hash function from weak ideal compression functions

SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Combinatorial multicollision attacks on generalized iterated hash functions

AISC '10 Proceedings of the Eighth Australasian Conference on Information Security - Volume 105
Breaking the ICE – finding multicollisions in iterated concatenated and expanded (ICE) hash functions

FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Multicollision Attacks on Some Generalized Sequential Hash Functions

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditionally in combinatorics on words one studies unavoidable regularities that appear in sufficiently long strings over a fixed size alphabet. Inspired by permutation problems originating from information security, another viewpoint is taken in this paper. We focus on combinatorial properties of long words in which the number of occurrences of any symbol is restricted by a fixed given constant.