Regular Expressions From Scratch, Part Two: Some Examples of Languages

Regular Expressions From Scratch, Part Two: Some Examples of Languages

  • Comments 2

Let's look at some sample languages to get a sense of just how flexible languages can be.

For example, here are some languages over the alphabet S = {0, 1}

L1 = all members of S*, period -- the language where every string is in the language

L2 = all members of S* such that there are more 1's than 0's. So L2 = {1, 11, 011, 101, 110, 111, …}

L3 = all members of S* such that the string is a prime number of 1's. So L3 = {11, 111, 11111, 1111111, 11111111111, …}

L4 = all members of S* such that there are n 1's and no 0's in the string, and furthermore, n is such that there is a nontrivial solution to Fermat's Last Theorem: an + bn = cn in natural numbers.

That is a perfectly good description of a language. In fact, it's a description of the finite language L4 = {1, 11}. We know that now, as Fermat's Last Theorem was proven. Twenty years ago though we would not have been able to enumerate all the members of this language with any confidence.

We can even come up with language descriptions that we cannot possibly know their members!

L5 = all members of S* such that there are n 1's and no 0's in the string, and furthermore, n is the largest number of quarters I had in my pocket at any time on the 13th of December, 1991.

That language has only one member, but darned if I know what it is!

This silly example raises an important point: in general, given a description of a language, we cannot know how many members the language has, whether it is finite or infinite, or whether any particular string is a member of the language.

We will be seeing later that there are definitely languages which cannot in principle be determined. That is, there is no way whatsoever of computing the members of the language.

For some languages though, we can build and analyze devices which recognize them - that is, when given a string and a language, a device can tell you whether or not the string is a member of the language.

To do that, we're going to need a way to describe languages in a very precise manner - we need a "language definition language" of some sort. The relationship between language recognizers and various metalanguages for describing languages will be a fundamental focus of this series.

Next time: concatenation of strings and languages

Page 1 of 1 (2 items)