You can get points by either finding mistakes in the atom book or by solving problems.
Grades:3=2 points, 4=2.5 points, 5=3 points.
Deadline: June 30
Each mistake in the atom book (not counting solutions to exercises) gets you 0.1 points. Mark the mistakes on this page with your name, if it does not work you can use this google docs. Mistakes also include typos, bad grammar, and unclear parts (explain why), generally speaking anything that requires improvement. You don’t need to start to read the book from the beginning. The lecture corresponds to Chapters 3,4,7 and 10, but you are encouraged to find mistakes in other parts (later chapters have a higher expected mistake rate, so it might be profitable to look at them).
Each of the problems (see below) gets you 1 point if it is solved by ≥3 people including you, 2 points otherwise.
for some Find an example of oligomorphic atoms and a language over input alphabet which is recognised by a deterministic orbit-finite automaton, but is not recognised by any equivariant deterministic register automaton.
(b) there is some such that property can be defined by a formula of first-order logic which has shape
Define the regular expressions to be the smallest class of languages (over orbit-finite alphabets) which: contains all languages with finitely many words and is closed under orbit-finite union, concatenation and Kleene star . Do regular expressions define the same languages as nondeterministic-orbit finite automata?