Conference item icon

Conference item

Quantifiers on languages and codensity monads

Abstract:

This paper contributes to the techniques of topoalgebraic recognition for languages beyond the regular setting as they relate to logic on words. In particular, we provide a general construction on recognisers corresponding to adding one layer of various kinds of quantifiers and prove a related Reutenauer-type theorem. Our main tools are codensity monads and duality theory. Our construction yields, in particular, a new characterisation of the profinite monad of the free S-semimodule monad for ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1109/LICS.2017.8005140

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Sub department:
Computer Science
Role:
Author
ORCID:
0000-0001-7331-7381
Publisher:
IEEE Publisher's website
Journal:
Annual Symposium on Logic in Computer Science Journal website
Pages:
1-12
Host title:
Proceedings - Symposium on Logic in Computer Science
Publication date:
2017-08-08
Acceptance date:
2017-02-15
Event title:
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Event location:
Reykjavík, Iceland
Event start date:
2017-06-20T00:00:00Z
Event end date:
2017-06-23T00:00:00Z
DOI:
EISBN:
978-1-5090-3018-7
ISSN:
1043-6871
ISBN:
978-1-5090-3019-4
Language:
English
Keywords:
Pubs id:
1113014
Local pid:
pubs:1113014
Deposit date:
2020-06-18

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP