A New Approach to Formal Language Theory using Kolmogorov Complexity: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 03:1903:19, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,185 bytes +2,185‎ Created page with "Title: A New Approach to Formal Language Theory using Kolmogorov Complexity Abstract: This research article proposes a new approach to formal language theory using Kolmogorov complexity, a concept from algorithmic information theory. The main results include an alternative to pumping lemmas, a new characterization for regular languages, and a new method to separate deterministic context-free languages and non-deterministic context-free languages. The use of 'compressibi..."
Retrieved from "https://simplesci.org/wiki/A_New_Approach_to_Formal_Language_Theory_using_Kolmogorov_Complexity"