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...
| Published in: | Logical Methods in Computer Science |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2008-11-01
|
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/1203/pdf |