arXiv · 2412.09688
Formal Languages and TQFTs with Defects
Abstract
A construction that assigns a Boolean 1D TQFT with defects to a finite state automaton was recently developed by Gustafson, Im, Kaldawy, Khovanov, and Lihn. We show that the construction is functorial with respect to the category of finite state automata with transducers as morphisms. Certain classes of subregular languages correspond to additional cohomological structures on the associated TQFTs. We also show that the construction generalizes to context-free grammars through a categorical version of the Chomsky-Sch\"utzenberger representation theorem, due to Melli\`es and Zeilberger. The corresponding TQFTs are then described as morphisms of colored operads on an operad of cobordisms with defects.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Luisa Boateng, Matilde Marcolli. 2024-12-12. Formal Languages and TQFTs with Defects. https://arxiv.org/abs/2412.09688
Cite the original work for its findings. Save a collection to share your selection of sources.