Recent Posts

Paper List The following includes my reading list and a list of papers organized in tracks which I can recommend to read. Most (all?) of them are about machine learning and neural networks. Reading List I am aware of the following papers and I want to read them ... when I have time … Read More »

Citizen Science Projects "Citizen Science Projects" are research projects that crowdsource a part of the research work. The idea behind that is quite simple: Some tasks of researchers are very simple. Everybody can do them. I think some of them are a great example of Gamification. Galaxy Zoo Galaxy Zoo is a crowdsourced … Read More »

Computer Science Jokes You have to read What is your best programmer joke?, What was the strangest coding standard rule that you were forced to follow? and What is the best comment in source code you have ever encountered? Hello World Cartoon Programming is like sex: One mistake and you have to support … Read More »

Bachelor Informatik, 1. Semester: Was bisher geschah Die erste Hälfte des Semesters ist nun vorbei und es wird Zeit zu wiederholen, was man wissen sollte. Eventuell ist diese Liste für ein paar Kommilitonen von nutzen. Wenn man gerade eines der Module macht, sollte man alles wissen, was in den Links steht. Naja, vielleicht nicht alles, aber man … Read More »

Eine Sprache ist nicht regulär - Beweis mit dem Pumping-Lemma Reguläre Sprachen können von endlichen Automaten erkannt werden. Das bedeutet, dass eine endliche Anzahl an Zuständen ausreicht, um ein Wort der Sprache zu akzeptieren. Wenn also eine Sprache $L = {a^i b^{2i} | i \in \mathbb{N}}$ beschrieben wird, müsste gezählt werden, wie oft a vorkommt. a kann aber beliebig … Read More »

Konstruktion eines deterministischen endlichen Automaten aus einem nicht-deterministischem Der nicht-deterministische endliche Automat zu dem regulärem Ausdruck $(a \cup (ab(b)^\text{}ba))^\text{}$ ist folgender: $Q = {S, q_1, q_2}$ $\Sigma = {a, b}$ $\delta = \text{siehe Grafik}$ $F = {S}$ $NEA = \left( Q, \Sigma, \delta, S, F \right)$ Nondeterministic finite-state machine Will man daraus nun den endlichen Automaten konstruieren, läuft … Read More »

How to draw a finite-state machine Finite-state machines are necessary to show that some problems are computable (or not). As I am currently learning something about them, I would like to be able to plot those finite automatons automatically. I will use graphviz. Nondeterministic finite-state machine Nondeterministic finite-state machine This image is created from a gv-file … Read More »

Joke: Electrical Engineering vs. Computer Science Nerd-Crossing I've just stumbled upon this joke on wilk4.com. This is the reason why I didn't use OOP in any of my (small) projects and why I don't understand those people who want every piece of code in OOP-style: Once upon a time, in a kingdom not far from … Read More »