Coalgebraic Automata Theory: Basic Results
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves weak pullbacks. We show that the class of recognizable langu...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Logical Methods in Computer Science e.V.
2008-11-01
|
| Serier: | Logical Methods in Computer Science |
| Fag: | |
| Online adgang: | https://lmcs.episciences.org/1203/pdf |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|