Automata and formal languages; Logic in computer science; Finite words; Context-free grammars; 2-tape automaton; Post correspondence problem; Weighted automaton; Finitely generated matrix subsemigroups of Z~(3×3); Models of set theory; Incompleteness theorems; Large cardinals; Inaccessible cardinals; Independence from the axiomatic system "ZFC + there exist n inaccessible cardinals"; Independence from Peano Arithmetic;
机译:不完整的定理,大型红衣主教和自动机
机译:有限自动机中非空词的有限半群,反馈和Letichevsky准则
机译:无限单词上加权推动自动机的核心定理和逻辑
机译:不完整定理,大基数和有限词自动机
机译:有限域上向量空间中的有限点配置和投影定理
机译:化学如何计算:非生化化学自动机的语言识别。从有限的自动机到图灵机
机译:有限话语的不完整定理,大型红衣主教和自动机