|
A Basis for a Mathematical Automata and Language Theory| old_uid | 11660 |
|---|
| title | A Basis for a Mathematical Automata and Language Theory |
|---|
| start_date | 2012/09/25 |
|---|
| schedule | 14h30-15h30 |
|---|
| online | no |
|---|
| location_info | salle 4B08R |
|---|
| summary | First we discuss decidability results, which cannot be achieved with methods of classical language and automata theory. Then we concentrate on the Conway theory of finite automata: Two additional axioms to the axioms of a semiring are enough to prove a generalization of the Kleene - Schützenberger Theorem and some algorithms on finite automata. |
|---|
| responsibles | Sigogne, Rakho |
|---|
| |
|