Nie jesteś zalogowany |
Expressiveness of Min/Max Automata
- Prelegent(ci)
- Amal Dev Manuel
- Afiliacja
- Uniwersytet Warszawski
- Termin
- 20 stycznia 2016 14:15
- Pokój
- p. 5870
- Seminarium
- Seminarium „Teoria automatów”
In this work we show how to decide if a given regular cost function is
recognised by a Min (Max) automaton. This is achieved by
characterising the classes of cost functions of the these automata
algebraically. Also a number of other characterisations are given.
recognised by a Min (Max) automaton. This is achieved by
characterising the classes of cost functions of the these automata
algebraically. Also a number of other characterisations are given.
