We define a bicategory whose 1-cells provide a categorification of transducers, computational devices extending finite-state automata with output capabilities. This bicategory is a mathematically interesting object: its objects are categories and its 1-cells consist of a category of states', and a profunctor $$ t : \mathcal{A} \times \mathcal{Q}^\text{op}\times\mathcal{Q} \times (\mathcal{B}^*)^\text{op} \to \mathbf{Set} $$ where $\mathcal{B}^*$ denotes the free monoidal category over $\mathcal{B}$. Extending $t$ to $\mathcal{A}^*$ in a canonical way, to each word’ in one attaches an endoprofunctor over the category of states, enriched over presheaves on . We discuss a number of other characterizations of the hom-category ; we establish a Kleisli-like universal property for and explore the connection of to other bicategories of computational models, such as Bob Walters’ bicategory of `circuits’; it is convenient to regard as the loose bicategory of a double category : the bicategory (resp., double category) of profunctors is naturally contained in the bicategory (resp., double category) (resp., ); we study the completeness and cocompleteness properties of , the existence of companions and conjoints, and we sketch how monads, adjunctions, and other structures/properties that naturally arise from the definition work in .

生成讲解博客的中文版本

生成AI智能校验的中文版本