A unified theory of finite-state recognisability

Project Information

LIPA

Grant agreement ID: 683080

DOI

10.3030/683080

Project closed

EC signature date 26 April 2016

Start date 1 May 2016

End date 31 October 2021

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 768 125,00

EU contribution

€ 1 768 125,00

Coordinated by

UNIWERSYTET WARSZAWSKI
Poland

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Other (7)

Stable graphs of bounded twin-width

Author(s): Jakub Gajarský, Michał Pilipczuk, Szymon Toruńczyk
Published in: arxiv, 2021
Publisher: arxiv

Monadic Monadic Second Order Logic

Author(s): Mikołaj Bojańczyk, Bartek Klin, Julian Salamanca
Published in: arxiv, 2021
Publisher: arxiv

A non-regular language of infinite trees that is recognizable by a finite algebra

Author(s): Mikołaj Bojańczyk, Bartek Klin
Published in: Logical Methods in Computer Science, 2018
Publisher: arxiv
DOI: 10.23638/lmcs-15(4:11)2019

Polyregular Functions

Author(s): Mikołaj Bojańczyk
Published in: arxiv, 2018
Publisher: arxiv

Two monads for graphs

Author(s): Mikołaj Bojańczyk
Published in: arxiv, 2018
Publisher: arxiv

Some connections between universal algebra and logics for trees

Author(s): Mikołaj Bojańczyk, Henryk Michalewski
Published in: arxiv, 2017
Publisher: arxiv

Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic

Author(s): Mikołaj Bojańczyk
Published in: arxiv, 2020
Publisher: arxiv

Conference proceedings (33)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata

Author(s): Mikołaj Bojańczyk, Bartek Klin, Joshua Moerman
Published in: LICS, 2021
Publisher: ACM
DOI: 10.1109/lics52264.2021.9470634

Timed Games and Deterministic Separability

Author(s): Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski
Published in: ICALP, 2020
Publisher: LIPIcs

Extensions of ω-Regular Languages

Author(s): Mikołaj Bojańczyk, Edon Kelmendi, Rafał Stefański, Georg Zetzsche
Published in: LICS, 2020
Publisher: ACM
DOI: 10.1145/3373718.3394779

Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers

Author(s): Mikołaj Bojańczyk, Janusz Schmude
Published in: MFCS, 2020
Publisher: LIPIcs
DOI: 10.4230/lipics.mfcs.2020.19

Uniformisation Gives the Full Strength of Regular Languages

Author(s): Nathan Lhote, Vincent Michielini, Michal Skrzypczak
Published in: MFCS, 2019
Publisher: LIPIcs
DOI: 10.4230/lipics.mfcs.2019.61

New Techniques for Universality in Unambiguous Register Automata

Author(s): Wojciech Czerwiński, Antoine Mottet, Karin Quaas
Published in: ICALP, 2021
Publisher: LIPIcs
DOI: 10.4230/lipics.icalp.2021.129

"Reducing Transducer Equivalence to Register Automata Problems Solved by ""Hilbert Method"""

Author(s): Adrien Boiret, Radoslaw Piórkowski, Janusz Schmude
Published in: FSTTCS, 2018
Publisher: LIPIcs
DOI: 10.4230/lipics.fsttcs.2018.48

An Approach to Regular Separability in Vector Addition Systems

Author(s): Wojciech Czerwiński, Georg Zetzsche
Published in: LICS, 2020
Publisher: ACM
DOI: 10.1145/3373718.3394776

Codensity Games for Bisimilarity

Author(s): Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Ichiro Hasuo
Published in: LICS, 2019
Publisher: ACM
DOI: 10.1109/lics.2019.8785691

Universality Problem for Unambiguous VASS

Author(s): Wojciech Czerwiński, Diego Figueira, Piotr Hofman
Published in: Concur, 2020
Publisher: LIPIcs
DOI: 10.4230/lipics.concur.2020.36

Improved Lower Bounds for Reachability in Vector Addition Systems

Author(s): Wojciech Czerwiński, Sławomir Lasota, Łukasz Orlikowski
Published in: ICALP, 2021
Publisher: LIPIcs
DOI: 10.4230/lipics.icalp.2021.128

Determinisability of One-Clock Timed Automata

Author(s): Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski
Published in: Concur, 2020
Publisher: LIPIcs
DOI: 10.4230/lipics.concur.2020.42

MSO+∇ is undecidable

Author(s): Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak
Published in: LICS, 2019
Publisher: ACM
DOI: 10.1109/lics.2019.8785892

Uniformisations of regular relations over bi-infinite words

Author(s): Grzegorz Fabiański, Michał Skrzypczak, Szymon Toruńczyk
Published in: LICS, 2020
Publisher: ACM
DOI: 10.1145/3373718.3394782

Optimizing Tree Decompositions in MSO

Author(s): Bojanczyk, Mikolaj ; Pilipczuk, Michal
Published in: STACS, 2017
Publisher: Leibniz International Proceedings in Informatics (LIPIcs)
DOI: 10.4230/LIPIcs.STACS.2017.15

Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices

Author(s): Laure Daviaud, Guillon, Pierre ; Merlet, Glenn
Published in: MFCS, 2017
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.MFCS.2017.19

Which Classes of Origin Graphs Are Generated by Transducers

Author(s): Mikołaj Bojańczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle
Published in: ICALP, 2017
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.114

Emptiness of Zero Automata Is Decidable

Author(s): Bojanczyk, Mikolaj ; Gimbert, Hugo ; Kelmendi, Edon
Published in: ICALP, 2017
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.106

Orbit-Finite Sets and Their Algorithms (Invited Talk)

Author(s): Mikolaj Bojanczyk
Published in: ICALP, 2017, Page(s) 1-14, ISBN 978-3-95977-041-5
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.1

Degree of Sequentiality of Weighted Automata

Author(s): Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois
Published in: FoSSaCS, 2017, Page(s) 215-230
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-54458-7_13

The Shortest Identities for Max-Plus Automata with Two States

Author(s): Laure Daviaud, Marianne Johnson
Published in: MFCS, 2017
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.MFCS.2017.48

Timed pushdown automata and branching vector addition systems

Author(s): Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
Published in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, Page(s) 1-12, ISBN 978-1-5090-3018-7
Publisher: IEEE
DOI: 10.1109/LICS.2017.8005083

Regular and First-Order List Functions

Author(s): Mikołaj Bojańczyk, Laure Daviaud, Shankara Narayanan Krishna
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Page(s) 125-134, ISBN 9781450355834
Publisher: ACM Press
DOI: 10.1145/3209108.3209163

Definability equals recognizability for graphs of bounded treewidth

Author(s): Mikołaj Bojańczyk, Michał Pilipczuk
Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, 2016, Page(s) 407-416, ISBN 9781-450343916
Publisher: ACM Press
DOI: 10.1145/2933575.2934508

WQO Dichotomy for 3-Graphs

Author(s): Sławomir Lasota, Radosław Piórkowski
Published in: Foundations of Software Science and Computation Structures, Issue 10803, 2018, Page(s) 548-564, ISBN 978-3-319-89365-5
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-89366-2_30

Definable decompositions for graphs of bounded linear cliquewidth

Author(s): Mikołaj Bojańczyk, Martin Grohe, Michał Pilipczuk
Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Page(s) 135-144, ISBN 9781450355834
Publisher: ACM Press
DOI: 10.1145/3209108.3209135

Thin MSO with a Probabilistic Path Quantifier

Author(s): Mikołaj Bojańczyk
Published in: ICALP, 2016
Publisher: Lipics
DOI: 10.4230/LIPIcs.ICALP.2016.96

Regular Choice Functions and Uniformisations For countable Domains

Author(s): Vincent Michielini, Michal Skrzypczak
Published in: MFCS, 2020
Publisher: LIPIcs
DOI: 10.4230/lipics.mfcs.2020.69

String-to-String Interpretations With Polynomial-Size Output

Author(s): Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote
Published in: ICALP, 2019
Publisher: LIPIcs
DOI: 10.4230/lipics.icalp.2019.106

Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages

Author(s): Bartek Klin, Sławomir Lasota, Szymon Toruńczyk
Published in: FoSSaCS, 2021
Publisher: Springer
DOI: 10.1007/978-3-030-71995-1_19

Single-Use Automata and Transducers for Infinite Alphabets

Author(s): Mikołaj Bojańczyk, Rafał Stefański
Published in: ICALP, 2020
Publisher: LIPIcs
DOI: 10.4230/lipics.icalp.2020.113

Iterated Covariant Powerset is not a Monad

Author(s): Bartek Klin; Julian Salamanca
Published in: MFPS, 2018
Publisher: Elsevier
DOI: 10.1016/j.entcs.2018.11.013

First-order tree-to-tree functions

Author(s): Mikolaj Bojanczyk, Amina Doumane
Published in: LICS, 2020
Publisher: ACM
DOI: 10.1145/3373718.3394785

Peer reviewed articles (4)

The Reachability Problem for Petri Nets is Not Elementary

Author(s): Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jerome Leroux, Filip Mazowiecki
Published in: JACM, 2021, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3422822

Reachability relations of timed pushdown automata

Author(s): Lorenzo Clemente; Sławomir Lasota
Published in: JCSS, 2020, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2020.11.003

Identities in upper triangular tropical matrix semigroups and the bicyclic monoid

Author(s): Laure Daviaud; Marianne Johnson; Mark Kambites
Published in: Journal of Algebra, 2017, ISSN 0021-8693
Publisher: Academic Press
DOI: 10.1016/j.jalgebra.2017.12.032

It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton

Author(s): Mikołaj Bojańczyk
Published in: Fundamenta Informaticae, Issue 154/1-4, 2017, Page(s) 37-46, ISSN 0169-2968
Publisher: IOS Press
DOI: 10.3233/FI-2017-1551