Friday, September 27, 2019 — 11:00 AM EDT

Sylvie Davies, Department of Pure Mathematics, University of Waterloo

"Algebraic Approaches to State Complexity of Regular Operations"

The state complexity of operations on regular languages is an active area of research in theoretical computer science. We describe various algebraic techniques for attacking state complexity problems. Our central result is a general method for constructing witness languages for operations - languages which attain the worst-case state complexity when used as the argument(s) of the operation. When a witness for an operation is known, determining the state complexity becomes essentially a combinatorial counting problem. We then look at methods to simplify the solution of these counting problems by taking advantage of the connections between regular languages and finite monoids.

MC 2009

S M T W T F S
29
30
31
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
1
2
  1. 2022 (75)
    1. June (14)
    2. May (13)
    3. April (14)
    4. March (15)
    5. February (12)
    6. January (7)
  2. 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)
  3. 2020 (103)
  4. 2019 (199)
  5. 2018 (212)
  6. 2017 (281)
  7. 2016 (335)
  8. 2015 (211)
  9. 2014 (235)
  10. 2013 (251)
  11. 2012 (135)