Duality in Formal Languages and Logic - a unifying approach to complexity and semantics | DuaLL | Project | Results | H2020 | CORDIS

Automata minimization: a functorial approach

Autori: Thomas Colcombet, Daniela Petrisan
Pubblicato in: Log. Methods Comput. Sci., Numero 16(1), 2020, Pagina/e 1:1-1:32, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-16(1:32)2020

Negative Translations of Orthomodular Lattices and Their Logic

Autori: Wesley Fussner, Gavin St. John
Pubblicato in: Electronic Proceedings in Theoretical Computer Science, Numero 343, 2021, Pagina/e 37-49, ISSN 2075-2180
Editore: Open Publishing Association
DOI: 10.4204/eptcs.343.3

Free Kleene algebras with domain

Autori: Brett McLean
Pubblicato in: Journal of Logical and Algebraic Methods in Programming, Numero 117, 2020, Pagina/e 100606, ISSN 2352-2208
Editore: Elsevier
DOI: 10.1016/j.jlamp.2020.100606

A categorical duality for algebras of partial functions

Autori: Brett McLean
Pubblicato in: Journal of Pure and Applied Algebra, Numero 225, no. 11, 2021, Pagina/e 106755, ISSN 0022-4049
Editore: Elsevier BV
DOI: 10.1016/j.jpaa.2021.106755

Coextensive varieties via Central Elements

Autori: Botero, W. J. Zuluaga
Pubblicato in: Algebra Universalis, Numero 82, 2021, Pagina/e 50, ISSN 0002-5240
Editore: Birkhauser Verlag
DOI: 10.1007/s00012-021-00745-2

Quantifiers on languages and codensity monads

Autori: Mai Gehrke, Daniela Petrişan, Luca Reggio
Pubblicato in: Mathematical Structures in Computer Science, Numero 30/10, 2020, Pagina/e 1054-1088, ISSN 0960-1295
Editore: Cambridge University Press
DOI: 10.1017/s0960129521000074

Priestley duality for MV-algebras and beyond

Autori: Wesley Fussner, Mai Gehrke, Samuel J. van Gool, Vincenzo Marra
Pubblicato in: Forum Mathematicum, Numero 33/4, 2021, Pagina/e 899-921, ISSN 0933-7741
Editore: Walter de Gruyter GmbH & Co. KG
DOI: 10.1515/forum-2020-0115

Poset Products as Relational Models

Autori: Wesley Fussner
Pubblicato in: Studia Logica, 2021, ISSN 0039-3215
Editore: Kluwer Academic Publishers
DOI: 10.1007/s11225-021-09956-z

Checking Admissibility Using Natural Dualities

Autori: Leonardo M. Cabrer, Benjamin Freisberg, George Metcalfe, Hilary A. Priestley
Pubblicato in: ACM Transactions on Computational Logic, Numero 20/1, 2019, Pagina/e 1-19, ISSN 1529-3785
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3275115

Codensity, profiniteness and algebras of semiring-valued measures

Autori: Luca Reggio
Pubblicato in: Journal of Pure and Applied Algebra, Numero 224/1, 2020, Pagina/e 181-205, ISSN 0022-4049
Editore: Elsevier BV
DOI: 10.1016/j.jpaa.2019.05.002

Residuation algebras with functional duals

Autori: Wesley Fussner, Alessandra Palmigiano
Pubblicato in: Algebra universalis, Numero 80/4, 2019, ISSN 0002-5240
Editore: Birkhauser Verlag
DOI: 10.1007/s00012-019-0613-5

A characterisation of the category of compact Hausdorff spaces

Autori: Vincenzo Marra, Luca Reggio
Pubblicato in: Theory and Applications of Categories, Numero vol. 35, no. 51, 2020, Pagina/e 1871-1906, ISSN 1201-561X
Editore: R. Rosebrugh

Operads of (noncrossing) partitions, interacting bialgebras, and moment-cumulant relations

Autori: Kurusch Ebrahimi-Fard, Loïc Foissy, Joachim Kock, Frédéric Patras
Pubblicato in: Advances in Mathematics, Numero 369, 2020, Pagina/e 107170, ISSN 0001-8708
Editore: Academic Press
DOI: 10.1016/j.aim.2020.107170

Some reducibility properties for pseudovarieties of the form DRH

Autori: Célia Borlido
Pubblicato in: Communications in Algebra, Numero 46/4, 2017, Pagina/e 1813-1830, ISSN 0092-7872
Editore: Marcel Dekker Inc.
DOI: 10.1080/00927872.2017.1360328

Checking Admissibility Using Natural Dualities

Autori: Cabrer, Leonardo M.; Freisberg, Benjamin; Metcalfe, George; Priestley, Hilary A.
Pubblicato in: ACM Transactions of Computer Systems, Numero 1, 2018, ISSN 0734-2071
Editore: Association for Computing Machinary, Inc.

An open mapping theorem for finitely copresented Esakia spaces

Autori: Samuel J. v. Gool, Luca Reggio
Pubblicato in: Topology and its Applications, Numero 240, 2018, Pagina/e 69-77, ISSN 0166-8641
Editore: Elsevier BV
DOI: 10.1016/j.topol.2018.03.006

Newton series, coinductively: a comparative study of composition

Autori: HENNING BASOLD, HELLE HVID HANSEN, JEAN-ÉRIC PIN, JAN RUTTEN
Pubblicato in: Mathematical Structures in Computer Science, 2017, Pagina/e 1-29, ISSN 0960-1295
Editore: Cambridge University Press
DOI: 10.1017/s0960129517000159

A survey on difference hierarchies of regular languages

Autori: Carton, Olivier; Perrin, Dominique; Pin, Jean-Éric
Pubblicato in: Logical Methods in Computer Science, Numero 1, 2018, Pagina/e vol 14, ISSN 1860-5974
Editore: Technischen Universitat Braunschweig
DOI: 10.23638/LMCS-14(1:24)2018

The κ -word problem over DRH

Autori: Célia Borlido
Pubblicato in: Theoretical Computer Science, Numero 702, 2017, Pagina/e 1-22, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2017.08.008

Canonical extensions: an algebraic approach to Stone duality

Autori: Mai Gehrke
Pubblicato in: Algebra universalis, Numero 79/3, 2018, ISSN 0002-5240
Editore: Birkhauser Verlag
DOI: 10.1007/s00012-018-0544-6

An Isbell duality theorem for type refinement systems

Autori: PAUL-ANDRÉ MELLIÈS, NOAM ZEILBERGER
Pubblicato in: Mathematical Structures in Computer Science, Numero 28/06, 2018, Pagina/e 736-774, ISSN 0960-1295
Editore: Cambridge University Press
DOI: 10.1017/s0960129517000068

Uniform Birkhoff

Autori: Mai Gehrke, Michael Pinsker
Pubblicato in: Journal of Pure and Applied Algebra, Numero 222/5, 2018, Pagina/e 1242-1250, ISSN 0022-4049
Editore: Elsevier BV
DOI: 10.1016/j.jpaa.2017.06.016

A general account of coinduction up-to

Autori: Filippo Bonchi, Daniela Petrişan, Damien Pous, Jurriaan Rot
Pubblicato in: Acta Informatica, Numero 54/2, 2017, Pagina/e 127-190, ISSN 0001-5903
Editore: Springer Verlag
DOI: 10.1007/s00236-016-0271-4

Stone duality, topological algebra, and recognition

Autori: Mai Gehrke
Pubblicato in: Journal of Pure and Applied Algebra, Numero 220/7, 2016, Pagina/e 2711-2747, ISSN 0022-4049
Editore: Elsevier BV
DOI: 10.1016/j.jpaa.2015.12.007

On uniformly continuous functions for some profinite topologies

Autori: Jean-Éric Pin, Pedro V. Silva
Pubblicato in: Theoretical Computer Science, Numero 658, 2017, Pagina/e 246-262, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2016.06.013

Commutative positive varieties of languages

Autori: Jorge Almeida, Zoltan Ésik, Jean-Éric Pin
Pubblicato in: Acta Cybernetica, Numero 23, 2017, ISSN 0324-721X
Editore: Szegedi Tudomanyegyetern/University of Szeged
DOI: 10.14232/actacyb.23.1.2017.7

Ultrafilters on words for a fragment of logic

Autori: Mai Gehrke, Andreas Krebs, Jean-Éric Pin
Pubblicato in: Theoretical Computer Science, Numero 610, 2016, Pagina/e 37-58, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2015.08.007

Classification of categories with matrices of coefficient 2 and order n

Autori: Samer Allouch, Carlos Simpson
Pubblicato in: Communications in Algebra, Numero 46/7, 2018, Pagina/e 3079-3091, ISSN 0092-7872
Editore: Marcel Dekker Inc.
DOI: 10.1080/00927872.2017.1404081

Complete κ-reducibility of pseudovarieties of the form DRH

Autori: Jorge Almeida, Célia Borlido
Pubblicato in: International Journal of Algebra and Computation, Numero 27/02, 2017, Pagina/e 189-235, ISSN 0218-1967
Editore: World Scientific Publishing Co
DOI: 10.1142/S0218196717500096

Stone duality above dimension zero: Axiomatising the algebraic theory of C(X)

Autori: Vincenzo Marra, Luca Reggio
Pubblicato in: Advances in Mathematics, Numero 307, 2017, Pagina/e 253-287, ISSN 0001-8708
Editore: Academic Press
DOI: 10.1016/j.aim.2016.11.012

Languages and formations generated by D4 and Q8

Autori: Jean-Éric Pin, Xaro Soler-Escrivà
Pubblicato in: Theoretical Computer Science, Numero 800, 2019, Pagina/e 155-172, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2019.10.023

Categorical combinatorics of scheduling and synchronization in game semantics

Autori: Paul-André Mellies
Pubblicato in: Proceedings of the ACM on Programming Languages, Numero 3/POPL, 2019, Pagina/e 1-30, ISSN 2475-1421
Editore: ACM
DOI: 10.1145/3290336

Dialogue Categories and Chiralities

Autori: Paul-André Melliès
Pubblicato in: Publications of the Research Institute for Mathematical Sciences, Numero 52/4, 2016, Pagina/e 359-412, ISSN 0034-5318
Editore: Kyoto Daigaku
DOI: 10.4171/prims/185

Difference hierarchies and duality with an application to formal languages

Autori: Célia Borlido, Mai Gehrke, Andreas Krebs, Howard Straubing
Pubblicato in: Topology and its Applications, Numero 273, 2020, Pagina/e 106975, ISSN 0166-8641
Editore: Elsevier BV
DOI: 10.1016/j.topol.2019.106975

Sheaves and duality

Autori: Mai Gehrke, Samuel J. v. Gool
Pubblicato in: Journal of Pure and Applied Algebra, Numero 222/8, 2018, Pagina/e 2164-2180, ISSN 0022-4049
Editore: Elsevier BV
DOI: 10.1016/j.jpaa.2017.09.004

Germinal theories in Łukasiewicz logic

Autori: Leonardo Manuel Cabrer, Daniele Mundici
Pubblicato in: Annals of Pure and Applied Logic, Numero 168/5, 2017, Pagina/e 1132-1151, ISSN 0168-0072
Editore: Elsevier BV
DOI: 10.1016/j.apal.2016.11.009

Canonical extensions of locally compact frames

Autori: Tomáš Jakl
Pubblicato in: Topology and its Applications, Numero 273, 2020, Pagina/e 106976, ISSN 0166-8641
Editore: Elsevier BV
DOI: 10.1016/j.topol.2019.106976

Unambiguous separators for tropical tree automata

Autori: Thomas Colcombet, and Sylvain Lombardy
Pubblicato in: Christophe Paul and Markus Bläser, editors, 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, Numero March 10-13, 2020, Montpellier, France, volume 154 of LIPIcs, 2020, Pagina/e 32:1–32:13
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2020.32

Classification of finite semigroups and categories using computational methods

Autori: Fussner, Wesley; Ghannoum, Najwa; Jakl, Tomás; Simpson, Carlos
Pubblicato in: https://hal.archives-ouvertes.fr/hal-02972963, Numero 1, 2020
Editore: Conference on Artificial Intelligence and Theorem Proving

Mining counterexamples for wide-signature algebras with an Isabelle server

Autori: Fussner, Wesley; Shminke, Boris
Pubblicato in: 6th Conference on Artificial Intelligence and Theorem Proving, Sep 2021, Aussois, France, Numero 1, 2021
Editore: 6th Conference on Artificial Intelligence and Theorem Proving

Learning automata and transducers: A categorical approach

Autori: Thomas Colcombet, Daniela Petrisan, and Riccardo Stabile
Pubblicato in: Christel Baier and Jean Goubault-Larrecq, editors, 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, Numero January 25-28, 2021, Ljubljana, Slovenia (Virtual Conference), volume 183 of LIPIcs, 2021, Pagina/e 15:1–15:17
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.csl.2021.15

Comprehension and Quotient Structures in the Language of 2-Categories

Autori: Paul-André Melliès; Nicolas Rolland
Pubblicato in: 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020), Numero 167, 2020, Pagina/e 6:1--6:18, ISBN 978-3-95977-155-9
Editore: Schloss Dagstuhl, Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.fscd.2020.6

Cost automata, safe schemes, and downward closures

Autori: David Barozzini, Lorenzo Clemente, Thomas Colcombet, and Pawel Parys
Pubblicato in: Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, Numero July 8-11, 2020, Saarbrücken, Germany (Virtual Conference), volume 168 of LIPIcs, 2020, Pagina/e 109:1–109:18
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2020.109

INEQUALITIES FOR ONE-STEP PRODUCTS

Autori: Branco , Mário; Pin , Jean-Eric
Pubblicato in: International Conference on Developments in Language Theory (DLT), Numero LNCS, volume 11088, 2018, Pagina/e 156-168
Editore: Springer
DOI: 10.1007/978-3-319-98654-8_13

Up-To Techniques for Behavioural Metrics via Fibrations

Autori: Bonchi, Filippo; König, Barbara; Petrisan, Daniela
Pubblicato in: 29th International Conference on Concurrency Theory (CONCUR 2018), Numero 1, 2018
Editore: Dagstuhl

Automata in the Category of Glued Vector Spaces

Autori: Colcombet, Thomas; Petrişan, Daniela
Pubblicato in: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Numero 1, 2017, Pagina/e 52:1-14
Editore: Dagstuhl

Automata Minimization: a Functorial Approach

Autori: Colcombet, Thomas; Petrişan, Daniela
Pubblicato in: 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), Numero 1, 2017
Editore: Dagstuhl

Quantifiers on languages and codensity monads

Autori: Mai Gehrke, Daniela Petrisan, Luca Reggio
Pubblicato in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, Pagina/e 1-12, ISBN 978-1-5090-3018-7
Editore: IEEE
DOI: 10.1109/LICS.2017.8005140

Stone Duality and the Substitution Principle

Autori: Célia Borlido, Silke Czarnetzki, Mai Gehrke, Andreas Krebs
Pubblicato in: 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), 2017
Editore: Dagstuhl
DOI: 10.4230/LIPIcs.CSL.2017.13

Logic and regular cost functions

Autori: Thomas Colcombet
Pubblicato in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, Pagina/e 1-4, ISBN 978-1-5090-3018-7
Editore: IEEE
DOI: 10.1109/LICS.2017.8005061

The Schützenberger product for syntactic spaces

Autori: Mai Gehrke, Daniela Petrisan, Luca Reggio
Pubblicato in: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Numero 55, 2016, Pagina/e 112:1--112:14, ISBN 978-3-95977-013-2
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2016.112

A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine

Autori: Paul-André Melliès, Noam Zeilberger
Pubblicato in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, 2016, Pagina/e 555-564, ISBN 9781-450343916
Editore: ACM Press
DOI: 10.1145/2933575.2934525

Duality in Computer Science

Autori: Mai Gehrke
Pubblicato in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, 2016, Pagina/e 12-26, ISBN 9781-450343916
Editore: ACM Press
DOI: 10.1145/2933575.2934575

Quantifiers on languages and codensity monads

Autori: Mai Gehrke, Daniela Petrisan, and Luca Reggio
Pubblicato in: Proceedings of the Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017), 2017
Editore: ACM

Higher-order parity automata

Autori: Paul-Andre Mellies
Pubblicato in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, Pagina/e 1-12, ISBN 978-1-5090-3018-7
Editore: IEEE
DOI: 10.1109/lics.2017.8005077

Dual space of a lattice as the completion of a Pervin space

Autori: Jean-Éric Pin
Pubblicato in: Relational and Algebraic Methods in Computer Science 16th International Conference, RAMiCS 2017, Lyon, France, May 15-18, 2017, Proceedings, Numero 10226, 2017, ISBN 978-3-319-57417-2
Editore: Springer
DOI: 10.1007/978-3-319-57418-92

On Reachability Problems for Low-Dimensional Matrix Semigroups

Autori: Colcombet, Thomas; Worrell, James; Ouaknine, Joel; Semukhin, Pavel
Pubblicato in: "46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.44⟩", Numero 23, 2019
Editore: LIPICS
DOI: 10.4230/LIPIcs.ICALP.2019.44

Optimal transformations of games and automata using muller conditions

Autori: Antonio Casares, Thomas Colcombet, and Nathanaël Fijalkow
Pubblicato in: Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, Numero July 12- 16, 2021, Glasgow, Scotland (Virtual Conference), volume 198 of LIPIcs, 2021, Pagina/e 123:1–123:14
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2021

A complexity approach to tree algebras: the bounded case

Autori: Thomas Colcombet, Arthur Jaquard
Pubblicato in: Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, Numero July 12-16, 2021, Glasgow, Scotland (Virtual Conference), volume 198 of LIPIcs, 2021, Pagina/e 127:1–127:13
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2021.127

A Cook's tour of duality in logic: from quantifiers, through Vietoris, to measures

Autori: Gehrke, Mai; Jakl, Tomas; Reggio, Luca
Pubblicato in: arxiv, Numero 1, 2020
Editore: arxiv

Learning proofs for the classification of nilpotent semigroups

Autori: Simpson, Carlos
Pubblicato in: https://hal.archives-ouvertes.fr/hal-03251094, Numero 1, 2021
Editore: HAL archives

Automata and minimization

Autori: Thomas Colcombet, Daniela Petrisan
Pubblicato in: ACM SIGLOG News, Numero 4(2), April 2017, 2017, Pagina/e 3-27
Editore: ACM

Stone duality for languages and complexity

Autori: Mai Gehrke, Andreas Krebs
Pubblicato in: ACM SIGLOG News, Numero 4(2), April 2017, 2017, Pagina/e 28-53
Editore: ACM

Difference-restriction algebras of partial functions with operators: discrete duality and completion

Autori: Borlido, Célia; McLean, Brett
Pubblicato in: arxiv, Numero 1, 2020
Editore: arxiv

Chapter 7: Open Problems About Regular Languages, 35 Years Later

Autori: Jean-Éric Pin
Pubblicato in: The Role of Theory in Computer Science: Essays Dedicated to Janusz Brzozowski, 2017, Pagina/e 153-175, ISBN 978-981-3148-19-2
Editore: WORLD SCIENTIFIC
DOI: 10.1142/9789813148208_0007

Chapter 8: The Dot-Depth Hierarchy, 45 Years Later

Autori: Jean-Éric Pin
Pubblicato in: The Role of Theory in Computer Science, 2017, Pagina/e 177-201
Editore: WORLD SCIENTIFIC
DOI: 10.1142/9789813148208_0008

Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games

Autori: Thomas Colcombet, Nathanaël Fijalkow
Pubblicato in: Foundations of Software Science and Computation Structures - 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, Numero 11425, 2019, Pagina/e 1-26, ISBN 978-3-030-17126-1
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-17127-8_1

A Duality Theoretic View on Limits of Finite Structures

Autori: Mai Gehrke, Tomáš Jakl, Luca Reggio
Pubblicato in: Foundations of Software Science and Computation Structures - 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings, Numero 12077, 2020, Pagina/e 299-318, ISBN 978-3-030-45230-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-45231-5_16

Controlling a Random Population

Autori: Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
Pubblicato in: Foundations of Software Science and Computation Structures - 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings, Numero 12077, 2020, Pagina/e 119-135, ISBN 978-3-030-45230-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-45231-5_7

Quantificateurs et dualité

Autori: Reggio, Luca
Pubblicato in: https://tel.archives-ouvertes.fr/tel-02459132, Numero 2, 2018
Editore: Université Paris Diderot

Duality in Formal Languages and Logic - a unifying approach to complexity and semantics

Pubblicazioni

Condividi questa pagina

Scarica