Formal languages and their relation to automata
Formal languages and their relation to automata
| Hi-index | 0.00 |
Formal language theory deals with a variety of classes of languages. Some of these are abstracting features of languages used for communication (as e.g., natural languages, programming languages or languages used in logic), some of them are abstracting features of languages used for description of processes (as e.g. basic classes of L languages) and still others are considered for mathematical reasons. Can we have a criterion for deciding whether a language can serve as a “communication language” (e.g. for man-to-man or man-to-machine communication) ? Our main result (The Basic Unpredictability Inequality) displays a connection between the “rate of unpredictability” and the relative number of subpatterns occurring in a language. After establishing this result we investigate (as samples) two classes of languages: regular languages and DOL languages