Automata, Formal Languages and Complexity
Properties of Recursively Enumerable Languages

Jörg Endrullis
Vrije Universiteit Amsterdam