Tuesday, June 11, 2019 — 2:30 PM EDT

Sylvie Davis, Department of Pure Mathematics, University of Waterloo

"Monoids, Computation, and the State Complexity of Regular Languages"

The state complexity of regular languages is an active area of research in theoretical computer science. A regular language is a set of words such that a computer program with finite memory can determine whether or not a word belongs to the language. Such programs are said to "recognize" the language. The state complexity of a regular language is a measure of the amount of memory required to recognize the language, with respect to a specific state-based model of computation called a deterministic finite automaton. We will explore the relationship between finite-memory computation and abstract algebra, and show how reinterpreting deterministic finite automata as monoid actions allows us to attack problems in state complexity.
 
MC 5479

S M T W T F S
28
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
  1. 2021 (135)
    1. December (11)
    2. November (22)
    3. October (15)
    4. September (5)
    5. August (15)
    6. July (17)
    7. June (15)
    8. May (1)
    9. April (4)
    10. March (11)
    11. February (9)
    12. January (10)
  2. 2020 (103)
    1. December (10)
    2. November (12)
    3. October (4)
    4. September (3)
    5. August (1)
    6. July (5)
    7. June (1)
    8. May (3)
    9. March (16)
    10. February (26)
    11. January (22)
  3. 2019 (199)
  4. 2018 (212)
  5. 2017 (281)
  6. 2016 (335)
  7. 2015 (211)
  8. 2014 (235)
  9. 2013 (251)
  10. 2012 (135)