A New Approach to Formal Language Theory by Kolmogorov Complexity
| dc.creator | Li, Ming | |
| dc.creator | Vitanyi, Paul | |
| dc.date | 2001-10-18 | |
| dc.date.accessioned | 2026-07-07T03:17:49Z | |
| dc.date.available | 2026-07-07T03:17:49Z | |
| dc.description | 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.) | |
| dc.identifier | https://arxiv.org/abs/cs/0110040 | |
| dc.identifier | http://arxiv.org/abs/cs/0110040 | |
| dc.identifier | M. Li and P.M.B. Vitanyi, A new approach to formal language theory by Kolmogorov complexity, SIAM J. Comput., 24:2(1995), 398-410 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30866 | |
| dc.subject | Computational Complexity | |
| dc.subject | F.4.2, F.2, I.2.7 | |
| dc.title | A New Approach to Formal Language Theory by Kolmogorov Complexity | |
| dc.type | text |