Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions - Coalgebraic Methods in Computer Science Access content directly
Conference Papers Year : 2014

Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions


It is a well-known fact that a nondeterministic automaton can be transformed into an equivalent deterministic automaton via the powerset construction. From a categorical perspective this construction is the right adjoint to the inclusion functor from the category of deterministic automata to the category of nondeterministic automata. This is in fact an adjunction between two categories of coalgebras: deterministic automata are coalgebras over S e t and nondeterministic automata are coalgebras over R e l . We will argue that this adjunction between coalgebras originates from a canonical adjunction between S e t and R e l . In this paper we describe how, in a quite generic setting, an adjunction can be lifted to coalgebras, and we compare some sufficient conditions. Then we illustrate this technique in length: we recover several constructions on automata as liftings of basic adjunctions including determinization of nondeterministic and join automata, codeterminization, and the dualization of linear weighted automata. Finally, we show how to use the lifted adjunction to check behavioral equivalence.
Fichier principal
Vignette du fichier
328263_1_En_10_Chapter.pdf (474.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01408759 , version 1 (05-12-2016)





Henning Kerstan, Barbara König, Bram Westerbaan. Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions. 12th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2014, Grenoble, France. pp.168-188, ⟨10.1007/978-3-662-44124-4_10⟩. ⟨hal-01408759⟩
49 View
145 Download



Gmail Facebook X LinkedIn More