A New Approach to Formal Language Theory by Kolmogorov Complexity

Authors:
Ming Li;Paul Vitanyi
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
1995

Citing 0
Cited 3

Church-Rosser Languages vs. UCFL

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Pushdown Automata Free of Explicit Nondeterminism and an Infinite Hierarchy of Context-free Languages

Fundamenta Informaticae
Pushdown Automata Free of Explicit Nondeterminism and an Infinite Hierarchy of Context-free Languages

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.