Types, Codes and TFTs
arXiv:1805.02286
Abstract
We establish a relation between fully extended -dimensional TQFTs and recognisable weighted formal languages, rational biprefix codes and lattice TFTs. We show the equivalence of closed TFTs and rational exchangeable series and we discuss the important special case of finite groups. Finally, we outline a reformulation in terms of a restricted version of second order monadic logic.
10 pages, at 11pt