![]() |
![]() |
University of Birmingham > Talks@bham > Theoretical computer science seminar > Transducers of polynomial growth
Transducers of polynomial growthAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact George Kaye. Zoom details
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:
Note that ex-directory lists are not shown. |
Other listsTheoretical computer science seminar Type the title of a new list here Beverley GloverOther talksWidth parameters and the maximum independent set problem TBA Bases for permutation groups TBA Quantum Sensing in Space An unobstructedness result for the coisotropic deformation problem |