Go to main content | Go to main menu | Go to search

Project information

Project information
Algebraic Methods in Automata and Formal Language Theory II

Investor logo
Project Identification
GA201/09/1313
Project Period
1/2009 - 12/2011
Investor / Pogramme / Project type
Czech Science Foundation
  • Standard Projects
MU Faculty or unit
Faculty of Science
Keywords
automata, regular languages, varieties, semirings, language equations

The project develops the algebraic methods in formal language theory. We
will further investigate the classes of syntactic structures of regular
languages like (ordered) syntactic monoids and semirings, and syntactic
homomorphisms with the goal of effective characterizations of membership to
important classes of languages. We will treat also classes of meet automata.


We plan to continue our research on implicit language equations, with an
emphasis on properties of their maximal solutions, aiming to identify which
types of systems of language equations have all maximal solutions always
regular. We will also concentrate on algebraic approach to the problem of
state complexity of operations on regular languages represented by two-way
automata.


We will enrich the q-theory and consider various logics for
characterizations of significant classes of languages.


Within the project we are going to continue our broad international
cooperation. The results will be presented at prestigious conferences and in
acknowledged journals.

Results

see http://www.math.muni.cz/~polak/Grant.html

Publications

Total number of publications: 20

2011

2010

2009

Previous 1 2 Next

You are running an old browser version. We recommend updating your browser to its latest version.

More info