Languages, automata and computations Solutions for tasks for Languages, automata and computations course. Course covered regular, context free laungages. Turing machines, classes of problems like P/NP. NP-completeness, computation complexity.