# Functorial concepts of complexity for finite automata.

Theory and Applications of Categories [electronic only] (2004)

- Volume: 13, page 164-168
- ISSN: 1201-561X

## Access Full Article

top## How to cite

topLawvere, F.William. "Functorial concepts of complexity for finite automata.." Theory and Applications of Categories [electronic only] 13 (2004): 164-168. <http://eudml.org/doc/124610>.

@article{Lawvere2004,

author = {Lawvere, F.William},

journal = {Theory and Applications of Categories [electronic only]},

keywords = {automata; finite topos; Boolean algebra; Aufhebung; measurement; measurable cardinals; axiomatic arithmetic},

language = {eng},

pages = {164-168},

publisher = {Mount Allison University, Department of Mathematics and Computer Science, Sackville},

title = {Functorial concepts of complexity for finite automata.},

url = {http://eudml.org/doc/124610},

volume = {13},

year = {2004},

}

TY - JOUR

AU - Lawvere, F.William

TI - Functorial concepts of complexity for finite automata.

JO - Theory and Applications of Categories [electronic only]

PY - 2004

PB - Mount Allison University, Department of Mathematics and Computer Science, Sackville

VL - 13

SP - 164

EP - 168

LA - eng

KW - automata; finite topos; Boolean algebra; Aufhebung; measurement; measurable cardinals; axiomatic arithmetic

UR - http://eudml.org/doc/124610

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.