Minimal Realization in Bicategories of Automata (1998)

Cached

Download Links

by Robert Rosebrugh , N. Sabadini , R. F. C. Walters
Venue:Math. Structures in Computer Science
Citations:3 - 1 self

Documents Related by Co-Citation

11 Minimal realization of machines in closed categories – J GOGUEN - 1972
42 Bicategories of Processes – P. Katis, N. Sabadini, R. F. C. Walters - 1997
7 The Dual of Substitution is Redecoration – Tarmo Uustalu, Varmo Vene - 2002
4 Freyd is Kleisli, for arrows – Bart Jacobs, Ichiro Hasuo - 2006
39 Generalized sequential machine maps – J W Thatcher - 2004
26 Bottom-up and top-down tree transformations—A comparison – Joost Engelfriet - 1975
18 The essence of dataflow programming – Tarmo Uustalu, Varmo Vene - 2005
2 Comonadic functional attribute evaluation – Tarmo Uustalu, Varmo Vene
149 Tree automata techniques and applications – Hubert Comon, Max Dauchet, Florent Jacquemard, Denis Lugiez, Sophie Tison, Marc Tommasi - 1997
12 Arrows, like monads, are monoids – Chris Heunen, Bart Jacobs - 2006
119 Mappings and grammars on trees – W Rounds - 1970
112 Categorical Logic and Type Theory – B Jacobs - 1999
99 Premonoidal Categories and Notions of Computation – John Power, Edmund Robinson - 1995
159 Generalising Monads to Arrows – John Hughes - 1998
3 Matrices, machines and behaviors – S Bloom, N Sabadini, R F C Walters - 1996
2 Lax monads – A Carboni, R Rosebrugh - 1991
1 On observing nondeterminism and concurrency. Automata, languages and programming – M Hennessey, R Milner - 1980
1 On partita doppia. Theory and Applications of Categories – P Katis, N Sabadini, R F C Walters
2 Classes of Finite State Automata for Which Compositional Minimization is Linear Time – P. Katis - 2001