What are some examples of a binary non-regular language?
(Originally posted by mistake on the forum for last year's course)
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.