A unified theory of finite-state recognisability

Stable graphs of bounded twin-width

Autores: Jakub Gajarský, Michał Pilipczuk, Szymon Toruńczyk
Publicado en: arxiv, 2021
Editor: arxiv

Monadic Monadic Second Order Logic

Autores: Mikołaj Bojańczyk, Bartek Klin, Julian Salamanca
Publicado en: arxiv, 2021
Editor: arxiv

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

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

Polyregular Functions

Autores: Mikołaj Bojańczyk
Publicado en: arxiv, 2018
Editor: arxiv

Two monads for graphs

Autores: Mikołaj Bojańczyk
Publicado en: arxiv, 2018
Editor: arxiv

Some connections between universal algebra and logics for trees

Autores: Mikołaj Bojańczyk, Henryk Michalewski
Publicado en: arxiv, 2017
Editor: 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

Autores: Mikołaj Bojańczyk
Publicado en: arxiv, 2020
Editor: arxiv

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata

Autores: Mikołaj Bojańczyk, Bartek Klin, Joshua Moerman
Publicado en: LICS, 2021
Editor: ACM
DOI: 10.1109/lics52264.2021.9470634

Timed Games and Deterministic Separability

Autores: Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski
Publicado en: ICALP, 2020
Editor: LIPIcs

Extensions of ω-Regular Languages

Autores: Mikołaj Bojańczyk, Edon Kelmendi, Rafał Stefański, Georg Zetzsche
Publicado en: LICS, 2020
Editor: ACM
DOI: 10.1145/3373718.3394779

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

Autores: Mikołaj Bojańczyk, Janusz Schmude
Publicado en: MFCS, 2020
Editor: LIPIcs
DOI: 10.4230/lipics.mfcs.2020.19

Uniformisation Gives the Full Strength of Regular Languages

Autores: Nathan Lhote, Vincent Michielini, Michal Skrzypczak
Publicado en: MFCS, 2019
Editor: LIPIcs
DOI: 10.4230/lipics.mfcs.2019.61

New Techniques for Universality in Unambiguous Register Automata

Autores: Wojciech Czerwiński, Antoine Mottet, Karin Quaas
Publicado en: ICALP, 2021
Editor: LIPIcs
DOI: 10.4230/lipics.icalp.2021.129

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

Autores: Adrien Boiret, Radoslaw Piórkowski, Janusz Schmude
Publicado en: FSTTCS, 2018
Editor: LIPIcs
DOI: 10.4230/lipics.fsttcs.2018.48

An Approach to Regular Separability in Vector Addition Systems

Autores: Wojciech Czerwiński, Georg Zetzsche
Publicado en: LICS, 2020
Editor: ACM
DOI: 10.1145/3373718.3394776

Codensity Games for Bisimilarity

Autores: Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Ichiro Hasuo
Publicado en: LICS, 2019
Editor: ACM
DOI: 10.1109/lics.2019.8785691

Universality Problem for Unambiguous VASS

Autores: Wojciech Czerwiński, Diego Figueira, Piotr Hofman
Publicado en: Concur, 2020
Editor: LIPIcs
DOI: 10.4230/lipics.concur.2020.36

Improved Lower Bounds for Reachability in Vector Addition Systems

Autores: Wojciech Czerwiński, Sławomir Lasota, Łukasz Orlikowski
Publicado en: ICALP, 2021
Editor: LIPIcs
DOI: 10.4230/lipics.icalp.2021.128

Determinisability of One-Clock Timed Automata

Autores: Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski
Publicado en: Concur, 2020
Editor: LIPIcs
DOI: 10.4230/lipics.concur.2020.42

MSO+∇ is undecidable

Autores: Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak
Publicado en: LICS, 2019
Editor: ACM
DOI: 10.1109/lics.2019.8785892

Uniformisations of regular relations over bi-infinite words

Autores: Grzegorz Fabiański, Michał Skrzypczak, Szymon Toruńczyk
Publicado en: LICS, 2020
Editor: ACM
DOI: 10.1145/3373718.3394782

Optimizing Tree Decompositions in MSO

Autores: Bojanczyk, Mikolaj ; Pilipczuk, Michal
Publicado en: STACS, 2017
Editor: 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

Autores: Laure Daviaud, Guillon, Pierre ; Merlet, Glenn
Publicado en: MFCS, 2017
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.MFCS.2017.19

Which Classes of Origin Graphs Are Generated by Transducers

Autores: Mikołaj Bojańczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle
Publicado en: ICALP, 2017
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.114

Emptiness of Zero Automata Is Decidable

Autores: Bojanczyk, Mikolaj ; Gimbert, Hugo ; Kelmendi, Edon
Publicado en: ICALP, 2017
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.106

Orbit-Finite Sets and Their Algorithms (Invited Talk)

Autores: Mikolaj Bojanczyk
Publicado en: ICALP, 2017, Página(s) 1-14, ISBN 978-3-95977-041-5
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2017.1

Degree of Sequentiality of Weighted Automata

Autores: Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois
Publicado en: FoSSaCS, 2017, Página(s) 215-230
Editor: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-54458-7_13

The Shortest Identities for Max-Plus Automata with Two States

Autores: Laure Daviaud, Marianne Johnson
Publicado en: MFCS, 2017
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.MFCS.2017.48

Timed pushdown automata and branching vector addition systems

Autores: Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki
Publicado en: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017, Página(s) 1-12, ISBN 978-1-5090-3018-7
Editor: IEEE
DOI: 10.1109/LICS.2017.8005083

Regular and First-Order List Functions

Autores: Mikołaj Bojańczyk, Laure Daviaud, Shankara Narayanan Krishna
Publicado en: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Página(s) 125-134, ISBN 9781-450355834
Editor: ACM Press
DOI: 10.1145/3209108.3209163

Definability equals recognizability for graphs of bounded treewidth

Autores: Mikołaj Bojańczyk, Michał Pilipczuk
Publicado en: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16, 2016, Página(s) 407-416, ISBN 9781-450343916
Editor: ACM Press
DOI: 10.1145/2933575.2934508

WQO Dichotomy for 3-Graphs

Autores: Sławomir Lasota, Radosław Piórkowski
Publicado en: Foundations of Software Science and Computation Structures, Edición 10803, 2018, Página(s) 548-564, ISBN 978-3-319-89365-5
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-89366-2_30

Definable decompositions for graphs of bounded linear cliquewidth

Autores: Mikołaj Bojańczyk, Martin Grohe, Michał Pilipczuk
Publicado en: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '18, 2018, Página(s) 135-144, ISBN 9781-450355834
Editor: ACM Press
DOI: 10.1145/3209108.3209135

Thin MSO with a Probabilistic Path Quantifier

Autores: Mikołaj Bojańczyk
Publicado en: ICALP, 2016
Editor: Lipics
DOI: 10.4230/LIPIcs.ICALP.2016.96

Regular Choice Functions and Uniformisations For countable Domains

Autores: Vincent Michielini, Michal Skrzypczak
Publicado en: MFCS, 2020
Editor: LIPIcs
DOI: 10.4230/lipics.mfcs.2020.69

String-to-String Interpretations With Polynomial-Size Output

Autores: Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote
Publicado en: ICALP, 2019
Editor: LIPIcs
DOI: 10.4230/lipics.icalp.2019.106

Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages

Autores: Bartek Klin, Sławomir Lasota, Szymon Toruńczyk
Publicado en: FoSSaCS, 2021
Editor: Springer
DOI: 10.1007/978-3-030-71995-1_19

Single-Use Automata and Transducers for Infinite Alphabets

Autores: Mikołaj Bojańczyk, Rafał Stefański
Publicado en: ICALP, 2020
Editor: LIPIcs
DOI: 10.4230/lipics.icalp.2020.113

Iterated Covariant Powerset is not a Monad

Autores: Bartek Klin; Julian Salamanca
Publicado en: MFPS, 2018
Editor: Elsevier
DOI: 10.1016/j.entcs.2018.11.013

First-order tree-to-tree functions

Autores: Mikolaj Bojanczyk, Amina Doumane
Publicado en: LICS, 2020
Editor: ACM
DOI: 10.1145/3373718.3394785

The Reachability Problem for Petri Nets is Not Elementary

Autores: Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jerome Leroux, Filip Mazowiecki
Publicado en: JACM, 2021, ISSN 0004-5411
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3422822

Reachability relations of timed pushdown automata

Autores: Lorenzo Clemente; Sławomir Lasota
Publicado en: JCSS, 2020, ISSN 0022-0000
Editor: Academic Press
DOI: 10.1016/j.jcss.2020.11.003

Identities in upper triangular tropical matrix semigroups and the bicyclic monoid

Autores: Laure Daviaud; Marianne Johnson; Mark Kambites
Publicado en: Journal of Algebra, 2017, ISSN 0021-8693
Editor: 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

Autores: Mikołaj Bojańczyk
Publicado en: Fundamenta Informaticae, Edición 154/1-4, 2017, Página(s) 37-46, ISSN 0169-2968
Editor: IOS Press
DOI: 10.3233/FI-2017-1551

Publicaciones

Compartir esta página

Descargar