A bialgebraic approach to automata and formal language theory

Annals of Pure and Applied Logic 163 (7):745-762 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Infinite games specified by 2-tape automata.Olivier Finkel - 2016 - Annals of Pure and Applied Logic 167 (12):1184-1212.
On church's formal theory of functions and functionals.Giuseppe Longo - 1988 - Annals of Pure and Applied Logic 40 (2):93-133.
A categorical approach to the theory of computation.Philip S. Mulry - 1989 - Annals of Pure and Applied Logic 43 (3):293-305.
Linear logic automata.Max I. Kanovich - 1996 - Annals of Pure and Applied Logic 78 (1-3):147-188.
Independence results in formal topology.Silvio Valentini - 2012 - Annals of Pure and Applied Logic 163 (2):151-156.
Epistemic and intuitionistic formal systems.R. C. Flagg & H. Friedman - 1986 - Annals of Pure and Applied Logic 32:53-60.
Cosheaves and connectedness in formal topology.Steven Vickers - 2012 - Annals of Pure and Applied Logic 163 (2):157-174.

Analytics

Added to PP
2013-10-27

Downloads
4 (#1,644,260)

6 months
21 (#133,716)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Bisimulations and Boolean Vectors.Melvin Fitting - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 97-125.

Add more references