Algebraic Methods in Automata and Formal Language Theory
- Project Identification
- Project Period
- 1/2006 - 12/2008
- Investor / Pogramme / Project type
- Czech Science Foundation
- MU Faculty or unit
- Faculty of Science
- 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
The results will be presented at prestigious conferencies and acknoledged
Total number of publications: 12