A categorical framework for finite state machines

Mathematical Structures in Computer Science

Volumn 13, Issue 3, 2003, Pages 451-480

  Hines, Peter ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 14544302250     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129503003931     Document Type: Article

References (12)

1. Abramsky, S. (1996) Retracing some paths in Process algebra. In CONCUR 96. Springer-Verlag Lecture Notes in Computer Science 1–17.
2. Abramsky, S. and Jagadeesan, R. (1992) New Foundations for the Geometry of Interaction. Proc. Seventh IEEE Symposium on Logic in Computer Science 211–222.
3. Birget, J.-C. (1989a) Basic Techniques for Two-way Finite Automata. In: Pin, J.E. (ed.) Formal Properties of Finite Automata and Applications. Springer-Verlag Lecture Notes in Computer Science 56–64.
4. Birget, J.-C. (1989b) Concatenation of inputs in a two-way automaton. Theoretical Computer Science 63 141–156.
5. Cohen, D. (1991) Introduction to Computer Theory, J. Wiley and Sons Inc.
6. Girard, J.-Y. (1987) Linear Logic. Theoretical Computer Science 50 1–102. Girard, J.-Y. (1988a) Geometry of interaction 1. Proceedings Logic Colloquium ’88, North Holland 221–260.
7. Girard, J.-Y. (1988b) Geometry of interaction 2. In: Martin-Lof, P. and Mints, G. (eds.) Proceedings of COLOG 88. Springer-Verlag Lecture Notes in Computer Science 417 76–93.
8. Howie, J. (1991) Automata and Languages, Oxford Science Publications, Oxford University Press.
9. Joyal, A., Street, R. and Verity, D. (1996) Traced Monoidal categories. Math. Proc. Camb. Phil. Soc. 425–446.
10. Kelly, G. and Laplaza, M. (1980) Coherence for compact closed categories. Journal of Pure and Applied Algebra 19 193–213.
11. Mac Lane, S. (1971) Categories for the working mathematician, Springer-Verlag.
12. Shepherdson, J. C. (1959) The reduction of two-way automata to one-way automata. IBM Journal of Research and Development 115–125.