A unified theory of finite-state recognisability

Stable graphs of bounded twin-width

Autori: Jakub Gajarský, Michał Pilipczuk, Szymon Toruńczyk
Pubblicato in: arxiv, 2021
Editore: arxiv

Monadic Monadic Second Order Logic

Autori: Mikołaj Bojańczyk, Bartek Klin, Julian Salamanca
Pubblicato in: arxiv, 2021
Editore: arxiv

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

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

Polyregular Functions

Autori: Mikołaj Bojańczyk
Pubblicato in: arxiv, 2018
Editore: arxiv

Two monads for graphs

Autori: Mikołaj Bojańczyk
Pubblicato in: arxiv, 2018
Editore: arxiv

Some connections between universal algebra and logics for trees

Autori: Mikołaj Bojańczyk, Henryk Michalewski
Pubblicato in: arxiv, 2017
Editore: 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

Autori: Mikołaj Bojańczyk
Pubblicato in: arxiv, 2020
Editore: arxiv

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata

Autori: Mikołaj Bojańczyk, Bartek Klin, Joshua Moerman
Pubblicato in: LICS, 2021
Editore: ACM
DOI: 10.1109/lics52264.2021.9470634

Timed Games and Deterministic Separability

Autori: Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski
Pubblicato in: ICALP, 2020
Editore: LIPIcs

Extensions of ω-Regular Languages

Autori: Mikołaj Bojańczyk, Edon Kelmendi, Rafał Stefański, Georg Zetzsche
Pubblicato in: LICS, 2020
Editore: ACM
DOI: 10.1145/3373718.3394779

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

Autori: Mikołaj Bojańczyk, Janusz Schmude
Pubblicato in: MFCS, 2020
Editore: LIPIcs
DOI: 10.4230/lipics.mfcs.2020.19

Uniformisation Gives the Full Strength of Regular Languages

Autori: Nathan Lhote, Vincent Michielini, Michal Skrzypczak
Pubblicato in: MFCS, 2019
Editore: LIPIcs
DOI: 10.4230/lipics.mfcs.2019.61

New Techniques for Universality in Unambiguous Register Automata

Autori: Wojciech Czerwiński, Antoine Mottet, Karin Quaas
Pubblicato in: ICALP, 2021
Editore: LIPIcs
DOI: 10.4230/lipics.icalp.2021.129

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

Autori: Adrien Boiret, Radoslaw Piórkowski, Janusz Schmude
Pubblicato in: FSTTCS, 2018
Editore: LIPIcs
DOI: 10.4230/lipics.fsttcs.2018.48

An Approach to Regular Separability in Vector Addition Systems

Autori: Wojciech Czerwiński, Georg Zetzsche
Pubblicato in: LICS, 2020
Editore: ACM
DOI: 10.1145/3373718.3394776

Codensity Games for Bisimilarity

Autori: Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Ichiro Hasuo
Pubblicato in: LICS, 2019
Editore: ACM
DOI: 10.1109/lics.2019.8785691

Universality Problem for Unambiguous VASS

Autori: Wojciech Czerwiński, Diego Figueira, Piotr Hofman
Pubblicato in: Concur, 2020
Editore: LIPIcs
DOI: 10.4230/lipics.concur.2020.36

Improved Lower Bounds for Reachability in Vector Addition Systems

Autori: Wojciech Czerwiński, Sławomir Lasota, Łukasz Orlikowski
Pubblicato in: ICALP, 2021
Editore: LIPIcs
DOI: 10.4230/lipics.icalp.2021.128

Determinisability of One-Clock Timed Automata

Autori: Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski
Pubblicato in: Concur, 2020
Editore: LIPIcs
DOI: 10.4230/lipics.concur.2020.42

MSO+∇ is undecidable

Autori: Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak
Pubblicato in: LICS, 2019
Editore: ACM
DOI: 10.1109/lics.2019.8785892

Uniformisations of regular relations over bi-infinite words

Autori: Grzegorz Fabiański, Michał Skrzypczak, Szymon Toruńczyk
Pubblicato in: LICS, 2020
Editore: ACM
DOI: 10.1145/3373718.3394782

Optimizing Tree Decompositions in MSO

Autori: Bojanczyk, Mikolaj ; Pilipczuk, Michal
Pubblicato in: STACS, 2017
Editore: 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

Autori: Laure Daviaud, Guillon, Pierre ; Merlet, Glenn
Pubblicato in: MFCS, 2017
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.MFCS.2017.19

Which Classes of Origin Graphs Are Generated by Transducers

Autori: Mikołaj Bojańczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle
Pubblicato in: ICALP, 2017
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.114

Emptiness of Zero Automata Is Decidable

Autori: Bojanczyk, Mikolaj ; Gimbert, Hugo ; Kelmendi, Edon
Pubblicato in: ICALP, 2017
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.106

Orbit-Finite Sets and Their Algorithms (Invited Talk)

Autori: Mikolaj Bojanczyk
Pubblicato in: ICALP, 2017, Pagina/e 1-14, ISBN 978-3-95977-041-5
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.1

Degree of Sequentiality of Weighted Automata

Autori: Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois
Pubblicato in: FoSSaCS, 2017, Pagina/e 215-230
Editore: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-54458-7_13

The Shortest Identities for Max-Plus Automata with Two States

Autori: Laure Daviaud, Marianne Johnson
Pubblicato in: MFCS, 2017
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.MFCS.2017.48

Timed pushdown automata and branching vector addition systems

Autori: Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
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.8005083

Regular and First-Order List Functions

Autori: Mikołaj Bojańczyk, Laure Daviaud, Shankara Narayanan Krishna
Pubblicato in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Pagina/e 125-134, ISBN 9781-450355834
Editore: ACM Press
DOI: 10.1145/3209108.3209163

Definability equals recognizability for graphs of bounded treewidth

Autori: Mikołaj Bojańczyk, Michał Pilipczuk
Pubblicato in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, 2016, Pagina/e 407-416, ISBN 9781-450343916
Editore: ACM Press
DOI: 10.1145/2933575.2934508

WQO Dichotomy for 3-Graphs

Autori: Sławomir Lasota, Radosław Piórkowski
Pubblicato in: Foundations of Software Science and Computation Structures, Numero 10803, 2018, Pagina/e 548-564, ISBN 978-3-319-89365-5
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-89366-2_30

Definable decompositions for graphs of bounded linear cliquewidth

Autori: Mikołaj Bojańczyk, Martin Grohe, Michał Pilipczuk
Pubblicato in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Pagina/e 135-144, ISBN 9781-450355834
Editore: ACM Press
DOI: 10.1145/3209108.3209135

Thin MSO with a Probabilistic Path Quantifier

Autori: Mikołaj Bojańczyk
Pubblicato in: ICALP, 2016
Editore: Lipics
DOI: 10.4230/LIPIcs.ICALP.2016.96

Regular Choice Functions and Uniformisations For countable Domains

Autori: Vincent Michielini, Michal Skrzypczak
Pubblicato in: MFCS, 2020
Editore: LIPIcs
DOI: 10.4230/lipics.mfcs.2020.69

String-to-String Interpretations With Polynomial-Size Output

Autori: Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote
Pubblicato in: ICALP, 2019
Editore: LIPIcs
DOI: 10.4230/lipics.icalp.2019.106

Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages

Autori: Bartek Klin, Sławomir Lasota, Szymon Toruńczyk
Pubblicato in: FoSSaCS, 2021
Editore: Springer
DOI: 10.1007/978-3-030-71995-1_19

Single-Use Automata and Transducers for Infinite Alphabets

Autori: Mikołaj Bojańczyk, Rafał Stefański
Pubblicato in: ICALP, 2020
Editore: LIPIcs
DOI: 10.4230/lipics.icalp.2020.113

Iterated Covariant Powerset is not a Monad

Autori: Bartek Klin; Julian Salamanca
Pubblicato in: MFPS, 2018
Editore: Elsevier
DOI: 10.1016/j.entcs.2018.11.013

First-order tree-to-tree functions

Autori: Mikolaj Bojanczyk, Amina Doumane
Pubblicato in: LICS, 2020
Editore: ACM
DOI: 10.1145/3373718.3394785

The Reachability Problem for Petri Nets is Not Elementary

Autori: Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jerome Leroux, Filip Mazowiecki
Pubblicato in: JACM, 2021, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3422822

Reachability relations of timed pushdown automata

Autori: Lorenzo Clemente; Sławomir Lasota
Pubblicato in: JCSS, 2020, ISSN 0022-0000
Editore: Academic Press
DOI: 10.1016/j.jcss.2020.11.003

Identities in upper triangular tropical matrix semigroups and the bicyclic monoid

Autori: Laure Daviaud; Marianne Johnson; Mark Kambites
Pubblicato in: Journal of Algebra, 2017, ISSN 0021-8693
Editore: 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

Autori: Mikołaj Bojańczyk
Pubblicato in: Fundamenta Informaticae, Numero 154/1-4, 2017, Pagina/e 37-46, ISSN 0169-2968
Editore: IOS Press
DOI: 10.3233/FI-2017-1551

Pubblicazioni

Condividi questa pagina

Scarica