February 2022
Beginner to intermediate
572 pages
13h
English
Regular languages can be infinite, as most of our examples have demonstrated. The fact that regular languages are associated with automata that have finite memory, however, imposes some limits on the structure of a regular language. Some narrow restrictions must be obeyed if regularity is to hold. Intuition tells us that a language is regular only if, in processing any string, the information that has to be remembered at any stage is strictly limited. This is true, but it has to be shown precisely to be used in any meaningful way. There are several ways in which this can be done.
The term “pigeonhole principle” is used by mathematicians to refer to the following simple observation. ...
Read now
Unlock full access