Project information
Algebraic Methods in Automata and Formal Language Theory
- Project Identification
- GA201/06/0936
- Project Period
- 1/2006 - 12/2008
- Investor / Pogramme / Project type
-
Czech Science Foundation
- Standard Projects
- MU Faculty or unit
-
Faculty of Science
- doc. RNDr. Libor Polák, CSc.
- doc. Mgr. Ondřej Klíma, Ph.D.
- doc. Mgr. Michal Kunc, Ph.D.
- Keywords
- automata, regular languages, varieties, semirings, infinite words, traces
The projects developes the algebraic methods in formal language theory.
In particular we will further investiagate the classes of
syntactic structures of a given regular language
like (ordered) syntactic monoids, syntactic semirings, syntactic
homomorphisms, syntactic semirings with the image of the language, etc.
with the goal consisting in effective characterizations of membership
to important classes of languages. We will also consider the graph structures
of the canonical automata.We will also deal with generalizations of the classical languages of finite
words to the so-called tree languages, languages of infinite words
and trace languages.
Within the project we are going to continue our broad international
cooperation.
The results will be presented at prestigious conferencies and acknoledged
journals.
Publications
Total number of publications: 12
2007
-
What do we know about language equations?
Developments in Language Theory: 11th International Conference, DLT 2007, Turku, Finland, July 2007, Proceedings, year: 2007
2006
-
On varieties of literally idempotent languages
Internal Proceedings, Mons Days of Theoretical Computer Science, year: 2006