Visitas Jan Rutten y Alexandra Silva

Oct ’15Oct
2123

Jan RuttenAlexandra SilvaLos profesores Jan Rutten (Radboud Universitet, Nijmegen y CWI, Amsterdam) Alexandra Silva (University College, London) visitarán la Universitat de València durante los días 21, 22 y 23 de octubre de 2015. Son expertos en álgebra universal y sus intereses en investigación incluyen los fundamentos coalgebraicos de la computación y los métodos formales para la ingeniería de la programación, especialmente programación orientada a servicios y basada en componentes. Vendrán como miembros del tribunal de la tesis doctoral de Enric Cosme i Llópez.

Paper “Varieties and covarieties of languages (extended abstract)” published in Electron. Notes Theor. Comput. Sci.

The following paper has been published.

El siguiente artículo ha sido publicado.

El següent article ha sigut publicat.

Jan Rutten, Adolfo Ballester-Bolinches, Enric Cosme-Llópez

Varieties and covarieties of languages (extended abstract)

Electron. Notes Theor. Comput. Sci., 298, 7-28 (2013)

http://dx.doi.org/10.1016/j.entcs.2013.09.005

Abstract: Because of the isomorphism (X × A) → X =∼ X → (A → X), the transition structure of a deterministic automaton with state set X and with inputs from an alphabet A can be viewed both as an algebra and as a coalgebra. This algebra-coalgebra duality goes back to Arbib and Manes, who formulated it as a duality between reachability and observability, and is ultimately based on Kalman’s duality in systems theory between controllability and observability. Recently, it was used to give a new proof of Brzozowski’s minimization algorithm for deterministic automata. Here we will use the algebra-coalgebra duality of automata as a common perspective for the study of both varieties and covarieties, which are classes of automata and languages defined by equations and coequations, respectively. We make a first connection with Eilenberg’s definition of varieties of languages, which is based on the classical, algebraic notion of varieties of (transition) monoids.
Keywords:
Automata, variety, covariety, equation, coequation, algebra, coalgebra.

Visita Jan Rutten

Mar ’13Mar
1115

Foto Jan RuttenEl profesor Jan Rutten visitará el Departament d’Àlgebra de la Universitat de València entre el 11 y el 15 de marzo de 2013. Jan Rutten es investigador sénior del CWI (Centro de Matemáticas e Informática), Ámsterdam, y profesor de informática teórica en la Universidad de Radboud, Nijmegen. Ha sido uno de los fundadores de la coálgebra universal, que es una teoría general del comportamiento circular de autómatas, sistemas dinámicos y estructuras de datos infinitos. Ha sido uno de los iniciadores de la serie de encuentros «Coalgebraic Methods in Computer Science» (CMCSC) y la «Conference on Algebra and Coalgebra in Computer Science (CALCO). Sus intereses en investigación incluyen los fundamentos coalgebraicos de la computación y los métodos formales para la ingeniería de la programación, especialmente programación orientada a servicios y basada en componentes.

 

Charla Jan Rutten

Mar ’13
13
11:00

El profesor Jan Rutten, CWI, Ámsterdam, y Universidad Radboud, Nijmegen, que nos visita entre el 11 y el 15 de marzo, impartirá la charla titulada

The method of coalgebra – an overview

el próximo miércoles 13 de marzo de 2013, a las 11.00, en el seminario del Departament d’Àlgebra de la Universitat de València (Facultat de Matemàtiques, 2º piso).

Resumen:

Since the early nineties, coalgebra has become an active area of research in which one tries to understand all kinds of infinite data types, automata, transition systems and dynamical systems from a unifying perspective. The focus of coalgebra is on observable behaviour and one uses coinduction as a central methodology, both for behavioural specifications and to prove behavioural equivalences. These days, one uses coalgebraic techniques in a wide variety of areas, ranging from automata theory to software engineering to ecology. In this talk, we shall illustrate the coalgebraic approach by discussing a number examples, including streams, automata and circuits.

Estáis todos invitados.