Geodesic
Functorial concepts of complexity for finite automata
Theory and applications of categories, The Carboni Festschrift, Tome 13 (2004), pp. 164-168

Voir la notice de l'article provenant de la source Theory and Applications of Categories website

Some unsolved problems about the classifying topos for Boolean algebras, as well as about the axiomatic arithmetic of finite combinatorial toposes, are closely connected with some simple distinctions between finite automata.

Classification : 05C35, 11B39, 11U10, 18B20, 18B25
Keywords: Automata, measurable cardinals, Aufhebung, finite topos, axiomatic arithmetic 
@article{TAC_2004_13_a9,
     author = {F. William Lawvere},
     title = {Functorial concepts of complexity for finite automata},
     journal = {Theory and applications of categories},
     pages = {164--168},
     publisher = {mathdoc},
     volume = {13},
     year = {2004},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/TAC_2004_13_a9/}
}
TY  - JOUR
AU  - F. William Lawvere
TI  - Functorial concepts of complexity for finite automata
JO  - Theory and applications of categories
PY  - 2004
SP  - 164
EP  - 168
VL  - 13
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TAC_2004_13_a9/
LA  - en
ID  - TAC_2004_13_a9
ER  - 
%0 Journal Article
%A F. William Lawvere
%T Functorial concepts of complexity for finite automata
%J Theory and applications of categories
%D 2004
%P 164-168
%V 13
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TAC_2004_13_a9/
%G en
%F TAC_2004_13_a9
F. William Lawvere. Functorial concepts of complexity for finite automata. Theory and applications of categories, The Carboni Festschrift, Tome 13 (2004), pp. 164-168. http://geodesic.mathdoc.fr/item/TAC_2004_13_a9/