MoL-2007-22: Remen, Petter (2007) Automata on flows. [Report]
Preview |
Text (Full Text)
MoL-2007-22.text.pdf Download (645kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
MoL-2007-22.abstract.txt Download (463B) |
Abstract
We introduce a coalgebraic generalization of an infinite word, namely
a sourced flow, followed by a definition of what it means for an
automaton to accept a sourced flow, thereby generalizing the notion of
\omega-regularity. We show that this definition yields a finitary
description of acceptance for finite sourced flows. We end by
presenting three characterization results on regular classes of finite
sourced flows.
| Item Type: | Report |
|---|---|
| Report Nr: | MoL-2007-22 |
| Series Name: | Master of Logic Thesis (MoL) Series |
| Year: | 2007 |
| Date Deposited: | 12 Oct 2016 14:38 |
| Last Modified: | 12 Oct 2016 14:38 |
| URI: | https://eprints.illc.uva.nl/id/eprint/794 |
Actions (login required)
 |
View Item |
