Page 1

Displaying 1 – 13 of 13

Showing per page

A coalgebraic view on reachability

Thorsten Wißmann, Stefan Milius, Shin-ya Katsumata, Jérémy Dubut (2019)

Commentationes Mathematicae Universitatis Carolinae

Coalgebras for an endofunctor provide a category theoretic framework for modeling a wide range of state-based systems of various types. We provide an iterative construction of the reachable part of a given pointed coalgebra that is inspired by and resembles the standard breadth-first search procedure to compute the reachable part of a graph. We also study coalgebras in Kleisli categories: for a functor extending a functor on the base category, we show that the reachable part of a given pointed coalgebra...

A generalized minimal realization theory of machines in a category.

Antonio Bahamonde (1983)

Stochastica

This paper presents a generalized minimal realization theory of machines in a category which contains the Kleiski case. The minimal realization is the cheapest realization for a given cost functor. The final reachable realization of Arbib and Manes ([5]) and the minimal state approach for nondeterministic machines are included here.

Automata and categories

Symeon Bozapalides, Anestis Firarides (1982)

Cahiers de Topologie et Géométrie Différentielle Catégoriques

Currently displaying 1 – 13 of 13

Page 1