MoL-2007-22: Automata on flows

MoL-2007-22: Remen, Petter (2007) Automata on flows. [Report]

Text (Full Text)

Download (645kB) | Preview
[img] Text (Abstract)

Download (463B)


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

Actions (login required)

View Item View Item