This post is about automata and languages that are used in theoretical computing. I was supplied 44 questions as a help to prepare for the exam in "Automaten und Sprachen" at HSR. So I'm going ahead and try to answer all of them. Please note that the original course was held in german, so my translation of certain terms might not always be perfect.

What is Σ*?
Σ^{*} is the number of words in the alphabet Σ.^{[1]} 
What is the difference between ε, Ø and {ε}?
 Ø signifies the empty language
 ε signifies the empty word
 {ε} stands for the language that consists only of the empty word = Σ^{0} != Ø

What's the difference between DEA/DFA and a NEA/NFA?
A nondeterministic finite automaton (NFA) has less strict rules then a deterministic finite automaton (DFA). Nondeterministic means it can transition to, and be in, multiple states at once.Deterministic means that it can only be in, and transition to, one state at a time.^{[2]}
When NFA model consists only of the main success path, failure paths don't have to be modelled, where as for a DFA all states have to be modelled. However every NFA can be transformed into a DFA. 
How to compare two finite automatons?
To compare two finite automata one has to transform them into the minimal automaton form. The minimal automaton consists only of the bare minimum of necessary states and transitions. 
State three methods to show that a language is regular
 NOT Pumping Lemma, see the source^{[3]}
 Myhill–Nerode theorem
 Closure properties of regular languages (set operations, concatenation, Kleene star, mirror, homomorphisms)^{[4]}

State two methods to show that a language is not regular
 Pumping Lemma (Proof by contradiction)
 Myhill–Nerode theorem^{[4:1]}

Describe the connection between DFAs, NFAs and regular expressions
Every nondeterministic finite automaton (NFA) can be transformed into a deterministic finite automaton (DFA). For every DFA a regular expression (regex) can be built that matches the words which the DFA would accept. 
How to prove that a language isn't regular with the pumping lemma?
[Full description here]({{ site.url }}/articles/Isthislanguageregular/) 
Describe DFAs for the languages Ø, {ε}, Σ^{*}
 DFA for the empty language Ø:
> o Σ> (o)  DFA for the language consisting only of the empty word {ε}:
> (o)  DFA for the empty language Ø:
> o
 DFA for the empty language Ø:

Why are finite languages regular?
A finite language can be accepted by a finite machine.^{[5]} 
State an example for a irregular language
L = {0^{n}1^{n}  n ≥ 0}, also the language of palindromes is also not regular. 
What is a context free grammar?
Regular languages read the characters of a word from left to right, after every character it checks whether a word is accepted. There are problems where this isn't ideal, for example to check the nesting of brackets. This is a problem where a context free grammar can be used. It consists of a finite amount of variables, a finite amount of characters also called tokens, a number of rules that consist of variables and tokens, a start variable S.
For example: A > ε
 A > AA
 A > (A)

What's the meaning of w ∈ L(G)?
Word w is part of Language L with grammar G. 
What are the characteristics of the Chomsky normal form (CNF)?
Every grammar in CNF is contextfree. Every grammar which is contextfree can be translated into a grammar that is in CNF. CNF conversion is used in some algorithms as a processing step, e.g., the CYK algorithm.^{[6]} 
How to bring a grammar into Chomsky normal form (CNF)?
Any context free grammar can be translated into CNF. This is done by replacing rules that aren't in CNF (Bad) through rules that are CNF conform (Good): Bad:
 S > A
 A > Bc
 A > cc
 Good:
 S_{0} > AB
 A > a
 S > ε
 Bad:

Is the Chomsky normal form unambiguous?
No it isn't.^{[7]} 
How to prove that a language is contextfree?
The pumping lemma for contextfree languages can be used to prove that a language is contextfree by splitting the words into 5 parts (uvxyz) and then pumping.
It can also be used to prove that a language isn't contextfree.^{[8]}^{[9]} 
How does a stack automaton (push down automaton  PDA) work?
Contextfree grammars produce languages that can't be accepted by a DFA. In order for an automaton to accept such a language it needs a storage. Stack automatons solve this problem by providing a stack storage. The arrows in the graph of a stack automaton are labeled like this: [INPUT], [ELEMENT ON STACK] > [WRITE TO STACK].
The items on the stack don't need to match with the input, they're part of their own alphabet. All valid operations for a stack machine work like the following examples: Replace: a,b > c (if input a, and b on top of stack, replace b with c)
 Push: a, ε > b (if input a, push b on top of the stack)
 Pop: a, b > ε (if input a, pop b off the top of the stack)
 Empty Transition: a, ε > ε (if input a, do nothing & go to next input)
 Halt: a, b > c (if input a, and b isn't on top of the stack, the machine halts)
 Start: ε, ε > $ (push $ on top of the stack, useful to detect when the stack is empty)
 Stop: ε, $ > ε (pop $ from the top of the stack, the stack should now be empty)

What properties are required for a language to have a stack automaton?
 be contextfree
 (CNF?)

Describe a technique to show that a language isn't contextfree
See Nr. 17, the pumping lemma for contextfree languages can be used to prove that a language isn't context free. In order to prove this we assume that a language is regular, use the pumping lemma and then check if a the pumped word is still in the language. If it isn't we have proven that the language isn't contextfree. 
What are grammars for the languages Ø, {ε}, Σ^{*}?
S > ε, S > S 
Describe the five typical steps to prove that a language isn't contextfree with the pumping lemma^{[8:1]}
 Assume that L is contextfree
 According to the pumping lemma the pumping length N exists
 Construct a word, for example a^{N}b^{N}c^{N} that is part of L.
 Divide the word into uvxyz so that ∣vxy∣ ≤ N and ∣vx∣ ≥ 0. For all i ≥ 0, uv^{i}wx^{i}y is in L.
 Pump v and y. If the word is still in L the language is contextfree, otherwise it isn't.

What is a typical not contextfree language?
Languages that require a stack machine to track more then one character aren't recognized on a normal stack machine with only one stack. It is possible to require such a language on a stack machine that has the required number of stacks, but it's
not possible on a standard stack automaton. An example for such a language is L = {a^{n}b^{n}c^{n}  n ∈ N}. 
Is there a turing machine with only one state?
No, since then there would be no transition function, so it wouldn't know whether to move left or right after a input. 
How many different languages can be recognized by turing machines with only two states?
A two state turing machine can be universal.^{[10]} A universal turing machine can simulate an arbitrary Turing machine on arbitrary input. So a two state turing machine can recognize all languages that can be recognized by a turing machine. The total amount of possible turing machines is countably infinite. 
Mention 3 types of turing machines
 Turing machines with only one band/storage.
 Multitrack turing machines (more then one band).
 Nondeterministic turing machines

M is a nondeterministic turing machine with w ∈ Σ^{*}. What's the meaning of w ∈ L(M)?
There is a turing machine M that accepts the word w. 
Why are there languages that aren't turingrecognizable?
A language is only turingrecognizable if it is enumerated by a enumerator. Intuitively, a language is Turingrecognizable if there is some computer program that, given a string in the language, can confirm that the string is indeed within the language.^{[11]} 
What's the difference between a turingrecognizable and a turingdecidable language?
A language is turingrecognizable if there is a turing machine with L=L(M). Words that aren't in the language aren't accepted but the machine will never stop, so you can't be certain if the machine will simply take a bit longer to recongize the word or if it really isn't part of the language.
A language is turingdecidable if it is recognized by a decider. A decider is a Turing machine tht stop for every input w ∈ Σ^{*}. Every Turingdecidable language is also turingrecognizable. The only difference is that a turingdecidable language the tm has to stop for any input, where as the tm for a turingrecognizable language might loop endlessly for certain inputwords. 
How to demonstrate that a turingrecognizable language is turingdecidable?
In order for a language to be turingdecidable there has to be a decider. A non deterministic turing machine is a decider if every possible calculation layer terminates. So finding a decider proves that the language is decidable. 
What is the prototypical undecidable problem for turing machines?
The acceptance problem. It asks whether a turing machine M will recognize a input word w. 
What is the reduction of a problem into another problem?
A reduction is an algorithm for transforming one problem into another problem. A reduction from one problem to another can be used to show that the second problem is just as difficult as the first.^{[12]} 
How to prove that a problem isn't decidable
One way is to reduce the problem into another problem that is known to be undecidable. 
What is an example for an undecidable problem?
The acceptance problem (see question 31). An other example would be the halting problem. A common explanation is the barber problem. A barber writes on a sign that he cuts the hair of all the people who don't cut their own hair. Now he can't
decide whether to cut his own hair or not. 
What is the halting problem?
The halting problem is the problem of determining, from the description of any computer program and input, whether the program will finish running or continue to run forever.^{[13]} 
How is the performance of an algorithm when switching from a specialized turing machine to a standard turing machine?
The emulation of a specialized turing machine on a standard turing machine will decrease the performance. 
What is polynomial reduction?
Languages are sorted by difficulty (≤ p) through polynomial reduction. 
How is the performance if a nondeterministic turing machine is simulated on a deterministic turing machine?
A nondeterministic turing machine with a runtime of t(n) can be simulated in 2^{O(t(n))} by a deterministic turing machine.^{[1:1]} 
What is the SAT problem?
The sentence of Cook and Levin proves that SAT is a NPcomplete problem. This means that any problem can be reduced to a SATproblem
in polynomial time. 
What's the difference between a problem like SAT and the integral division of numbers?
SAT is npcomplete. 
How to test if a programming language is turingcomplete?
In order for a programming language to be turingcomplete it has to be possible to program a turing machine simulator. 
Why is the language LOOP not turingcomplete?
LOOP isn't turingcomplete because all LOOP programs terminate in every case, but there are turing machines that terminate never. 
Are there problems that can be sloved in (programming language) WHILE but not in (programming language) GOTO?
No, the goto command and the loop command are equal. A programming language can either offer a goto or a while loop control structure (or both) and still be turingcomplete. 
Is it possible to write a compiler that translates CCode to (programming language) Brainfuck?
Yes Brainfuck is turingcomplete so every possible computation can be done using that language.
Terminology^{[1:2]}
 Alphabet: An alphabet contains all the valid characters of a language. It is designated by the character Σ.
 Word: A word consists only of valid characters that are ordered in a way so that the word is part of the language definition.
 Empty word: The empty word is the only word of length 0. It is designated by the character ε.
 Language: A language is a subset of all possible charactercombinations of an alphabet. The valid charactercombinations are called words.
 Regular: A language is regular if a DEA/DFA (Deterministic finite automaton) exists that accepts the language.
 DEA/DFA: A deterministic finite automaton models a system with a finite number of different states. The transition between states happens deterministically when new data arrives. Formally a DFA consists of 5 elements:
a finite number of states (Q), a alphabet (Σ), one or more transitionfunctions, a start state (q0), one or more accepting states (F).  Nondeterministic: Something is nondeterministic when there is more then one possible transition from one state to another.
 NEA/NFA: A Nondeterministic finite automaton doesn't need to obey the restrictions of a DEA/DFA. Every DEA/DFA is also a NEA/NFA.
 Accept: A automaton accepts a word if it fulfills it's language definition and consists of valid characters.
 Accepted language of a DEA/DFA: A DEA/DFA naturally defines a language that consists of words that can be used as input for the DEA/DFA. The DEA/DFA transitions theses words from a start state to a acceptance state.
 Regex: Regular expressions are just as expressive as DEA/DFAs but more practical because of their simple syntax.
 Grammar: A grammar generates a language by executing a set of rules on the start variable. This is repeated until no more
variables exist except for a chain of tokens. Grammars are used for context free languages and stack automatons.  Contextfree: A contextfree language (CFL) is generated by a contextfree grammar (CFG). CFL are used because regular languages aren't very practical, many languages aren't regular. A DEA/DFA can't remember the amount of open brackets, to be able to do that it
would need infinite states.  Variable: A placeholder for a value.
 Rule: A contextfree grammar (CFG) uses rules consisting of a variable and a chain of variables & tokens. A rule could look like this
A > BCx
.  Derivation: Two derivations of a word are equivalent if they have the same derivation tree.
 Parsetree: The parsetree of a word of a contextfree language is a representation of the used production rules.
 Generated language of a grammar: A language that is generated by a contextfree grammar (CFG).
 Stack automaton: CFGs generate languages that are accepted by a DEA/DFA, that's why stack automatons were invented. A stack automaton consists of 6 elements: states (Q), entryalphabet (Σ), stackalphabet (Γ), transitionfunctions, startstate (q0), acceptancestates (F).
 Turing machine: A Turing machine manipulates symbols on a strip of tape according to a table of rules. A turing machine can simulate the logic of any computer algorithm.
 Recognized language of a turing machine: A language L is turingrecognizable if there is a turing machine with L = L(M).
 Decider: A decider is a turing machine that stops for every input of w ∈ Σ^{*}.
 Determinable language: A language is determinable if a decider recognises the language.
 Acceptance problem: The acceptance problem for turingrecognisable languages asks if the turingmachine M will recognise a input word w. M itself can't be run because it's possible that M will run into an infiniteloop.
 Countable infinite: A infinite amount A is countable infinite if it is as powerful as the natural numbers.
 Innumerable infinite: A infinite amount A is innumerable infinite if there is no bijection between the natural numbers and A.
 Reduction: Reduction is used to compare two languages. In the reduction process words from language A are mapped to language B.
 Polynomial runtime: An algorithm can be solved in polynomial time if the number of steps required to complete the algorithm is O(n^{k})
for some nonnegative integer k, were n is the complexity of the input. Polynomialtime algorithms are said to be "fast".^{[14]}  P and NP: The class P consists of languages that can be decided by a decider with a polynomial runtime. The class of problems that can't be decided by a polynomial turing machine is called NP (nondeterministic polynomial time).
 NPcomplete: A decision problem is NPcomplete when it is both in NP and NPhard. A problem p in NP is NPcomplete if every other problem in NP can be transformed into p in polynomial time.^{[15]}
 Polynomial reduction: Languages are sorted into difficultycategories with the polynomial reduction.
 SAT: The language
SAT = {φ  φ is a solvable logical formula}
is decidable. SAT is in NP because there is a polynomial verifier.  3SAT: 3SAT is NPcomplete.
 Clique: A kClique in a graph G is an amount of k corners of the graph, so that in G every corner of the subset is connected to every other corner.
Simplified: everyone knows everyone.  Turingcomplete: A programming language is turingcomplete if every calculable mapping can be formulated in that language.
 LOOP: LOOP is a programming language with only one control structure, the iteration of a instruction block with a fixed amount of passes.