  A novel notion of unpredictable strings is revealed and utilized to define
deterministic unpredictable sequences on a finite number of symbols. We prove
the first law of large strings for random processes in discrete time, which
confirms that there exists the uncountable set of unpredictable realizations.
The hypothesis on the second law of large strings is formulated, which is
relative to the Bernoulli theorem. Theoretical and numerical backgrounds for
the laws are provided.
