Decomposition of regular languages

Vortrag von Tomáš Masopust

Veranstaltungsort: APB 3027
Beginn: 16. März 2017 um 11:00
Ende: 16. März 2017 um 12:00
Forschungsgruppe: Wissensbasierte Systeme
Event series: KBS Seminar
iCal

I will discuss a problem how to decompose a regular language with respect to a set of alphabets and will show how to overcome undecidability by using a small trick, which leads to polynomial complexity.