A New Approach to Formal Language Theory by Kolmogorov Complexity

Details A New Approach to Formal Language Theory by Kolmogorov Complexity A New Approach to Formal Language Theory by Kolmogorov Complexity

2001-10-18

arxiv.org/abs/cs/0110040v1

M. Li and P.M.B. Vitanyi, A new approach to formal language theory by Kolmogorov complexity, SIAM J. Comput., 24:2(1995), 398-

Computer Science

Computational Complexity

Scientific paper

We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate deterministic context-free languages and nondeterministic context-free languages. The use of the new `incompressibility arguments' is illustrated by many examples. The approach is also successful at the high end of the Chomsky hierarchy since one can quantify nonrecursiveness in terms of Kolmogorov complexity. (This is a preliminary uncorrected version. The final version is the one published in SIAM J. Comput., 24:2(1995), 398-410.)

Affiliated with

Also associated with

No associations

Rating

A New Approach to Formal Language Theory by Kolmogorov Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A New Approach to Formal Language Theory by Kolmogorov Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Approach to Formal Language Theory by Kolmogorov Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-283597