Speaker / Predavač :

Prof. Benedek Nagy
University of Debrecen, Hungary
He is also with Eastern Mediterranean University, Famagusta, North Cyprus, Turkey

Title / Naslov:

Automata with translucent letters and other topics of formal languages and automata theory

Abstract / Apstrakt:

Automata for translucent letters were introduced as an alternaive name of cooperative distributed systems of stateless determinisitc R restaring automata with window size 1. This modell can accept every rational trace language (including every commutative semi-linear language) and some other languages as well. In the presentation this modell is shown with some of its properties.

I will also present some other results briefly, e.g. defining union-complexity of regular languages, 2-head finite automata for linear context-free languages and left-most derivations for context-sensitive languages.