• Keine Ergebnisse gefunden

Algebraic Automata Theory

N/A
N/A
Protected

Academic year: 2021

Aktie "Algebraic Automata Theory"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

ITI

Institut für Theoretische Informatik

Dr. Jürgen Koslowski

Algebraic Automata Theory

Sheet 1, 2017-11-09

Exercise 1[10Points]

Analyse the following polarities in rel when B= 1.

[A, B] [B, C]op

T /

. T

` as well as [C, B] [B, A]op

Top/

. Top

`

Turn them into adjunctions between the power-sets AP and (CP)op. What happens, if the relationA T C is left-adjoint,i.e., a functionA h C?

Exercise 2[12Points]

Show in detail that the two characterizations of adjunctions F aG in Cat are equivalent:

(a) There exist natural transformationsA η F GandGF B subject to

A A

B B

A

F G

B

η F =

A F B

F id

A A

B B

A

F G

B

G η =

A

B G

G id

(b) There exitst a natural isomorphism

Aop×B set

[−F,−]

[−,−G]

ι

Exercise 3[15Points]

Australian “mate calculus”: consider a 2-category B, where the 1-cells are denoted by arrows of the form , while the left-adjoint 1-cells ormaps are denoted by arrows of the form .

(2)

Prove that there is a bijective correspondence between 2-cells of the following types:

A B

C D

f

g

R α S and

A B

C D

f0

g0

R α0 S

where f af0 and gag0.

due on Thursday, 2017-11-16, 13:15,

Referenzen

ÄHNLICHE DOKUMENTE

[r]

Monoids with an absorbing element 0 or ⊥ are also known as binoids.. Their homomorphisms have to preserve the

Remark: A more conventional point of view that avoids the notion of 2-cells is to consider F -slat as a monoidal category, i.e., as a category C equipped with two functors C × C ⊗ C

A prominent example of a symbolic data structure are finite automata and transducers: Given an encoding of configurations as words over some alphabet Σ , the set P and the step

Der Begriff der Gr¨ oße einer Formel funktioniert nat¨ urlich auch mit den abgeleiteten Junktoren.. ⇒, ⇔, ⊕ und ↑ (“nand”,

Beispiel: f¨ ur den Tr¨ ager IN , das Pr¨ adikat P (x) “x ist gerade” und den Term t := x + 1 passiert genau das: P (t) ist nur f¨ ur ungerade Zahlen erf¨ ullt, aber die

Roland Meyer (TU KL) Applied Automata Theory (WiSe 2013) 2 / 161... Table of

We obtain a covariant functor from Spaces to the category Catcofwe of categories with cofibrations and weak equivalences.... Next we explain how to associate to a category