This paper investigates the concept of substring languages as an alternative to the traditional parsing scheme. Practical grounds are also presented. Then the properties of substring languages are investigated. The paper proposes the most rudimentary characteristics of substring languages and relations of this concept to classes: REG, CFL, REC and REL. Finally, the map of problem solutions in substring sense is presented.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.