We show that automata can be described uniformly as coalgebras for a functor. For every such functor we present a modal language that allows us to speak about states of automata. We discuss soundness and completeness of semantics of our language.
| List |
| Bachelor thesis: | Coalgebraic Approach to Automata Theory ( PDF ) |
|---|---|
| Author: | Dostál Matěj |
| Supervisor: | doc. RNDr. Jiří Velebil, Ph.D. |
| Keywords: | |
| Abstract: | We show that automata can be described uniformly as coalgebras for a functor. For every such functor we present a modal language that allows us to speak about states of automata. We discuss soundness and completeness of semantics of our language.
|
| Submited: | Jun 2010 |
| More info: |