Decomposition of regular languages
From International Center for Computational Logic
Decomposition of regular languages
Talk by Tomáš Masopust
- Location: APB 3027
- Start: 16. March 2017 at 11:00 am
- End: 16. March 2017 at 12:00 pm
- Research group: Knowledge-Based Systems
- 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.
