Transducers of polynomial growth

Add to your list(s) Download to your calendar using vCal

• Mikołaj Bojańczyk (University of Warsaw)
• Friday 25 March 2022, 14:00-15:00
• LG23, SoCS and Zoom (see abstract for link).

If you have a question about this talk, please contact George Kaye.

Zoom details

• Link: https://bham-ac-uk.zoom.us/j/81873335084?pwd=T1NaUFg2U1l6d0RLL2RlTzFBam1IUT09
• Meeting ID: 818 7333 5084
• Passcode: 217

Abstract

Transducers are like automata, but instead of accepting/rejecting they produce an output, such as a string or a tree. In my talk, I will discuss some recent results transducers, mainly about the class of polyregular transducers, which can be seen as a candidate for the notion of “regular” string-to-string transducers of polynomial growth. I will discuss how this class can be characterised in many different ways, including logic, automata, and λ-calculus.

This talk is being chaired by Eric Finster.

This talk is part of the Theoretical computer science seminar series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• LG23, SoCS and Zoom (see abstract for link)
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.