Automata in semigroup theory, group theory and analysis

半群论、群论和分析中的自动机

• 批准号: 262403-2007
• 负责人: Steinberg, Benjamin
• 金额: $ 1.24万
• 依托单位: Carleton University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2008
• 资助国家: 加拿大
• 起止时间: 2008-01-01 至 2009-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=395460
• 关键词: Automata; semigroup; theory; group; analysis

Finite state automata are a fundamental model of computation in theoretical computer science. They are used both as machines to recognize regular languages, and as machines to transform input strings into output strings. They also play a key role in compilers of computing languages. In addition, automata form a basic building block for more complicated models of computation. Automata theory has also found many applications in pure mathematics. Applications can be found in such diverse areas of mathematics as: group theory, semigroup theory, symbolic dynamics and holomorphic dynamics.

有限状态自动机是理论计算机科学中的一个基本计算模型。 它们既被用作识别常规语言的机器，又被用作将输入字符串转换为输出字符串的机器。它们在计算语言的编译器中也起着关键作用。 此外，自动机形成了更复杂的计算模型的基本构建块。 自动机理论在纯数学中也有许多应用。 应用可以发现在这样的不同领域的数学：群论，半群理论，符号动力学和全纯动力学。