2000 character limit reached
Boolean TQFTs with accumulating defects, sofic systems, and automata for infinite words
Published 25 Dec 2023 in math.CT, cs.FL, math-ph, math.DS, math.MP, and math.QA | (2312.17033v1)
Abstract: Any finite state automaton gives rise to a Boolean one-dimensional TQFT with defects and inner endpoints of cobordisms. This paper extends the correspondence to Boolean TQFTs where defects accumulate toward inner endpoints, relating such TQFTs and topological theories to sofic systems and $\omega$-automata.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.