Author: Dimitris Dimitriadis

To estimate the running time of an algorithm and the difference of the algorithm against others, we make a strong…

A finite state automaton (FSA) is a computational model and is defined by the following 5 parameters: Q: a finite…

Google supports students and researchers (academic staff, in general) offering some of their services for free. In Aristotle University of…

Question Answering (QA) is an AI-complete problem meaning that the current state-of-the-art approaches can not solve it. One of the…