Non-regular languages

Re: Non-regular languages

by Giorgio Satta -
Number of replies: 0

Finte state automata have a quite restricted computational power. Later on in the course we will investigate more powerful models recognising languages that are not regular.

But it is too early now to provide examples, you need to wait a few more weeks.