Mikolaj Bojanczyk

188 papers A* 41A 9B 12C 4Journal 100Unranked 19
YearRankTypeTitle / Venue / Authors
2025 J jnl
Categories for Automata and Language Theory (Dagstuhl Seminar 25141).
Dagstuhl Reports
Achim Blumensath, Mikolaj Bojanczyk, Bartek Klin, Daniela Petrisan
2025 A* conf
Graphs of unbounded linear cliquewidth must transduce all trees.
LICS
Mikolaj Bojanczyk, Pierre Ohlmann
2025 J jnl
Graphs of unbounded linear cliquewidth must transduce all trees.
CoRR
Mikolaj Bojanczyk, Pierre Ohlmann
2025 J jnl
Low rank MSO.
CoRR
Mikolaj Bojanczyk, Michal Pilipczuk, Wojciech Przybyszewski, Marek Sokolowski, Giannos Stamoulis
2024 A* conf
Function Spaces for Orbit-Finite Sets.
ICALP
Mikolaj Bojanczyk, Lê Thành Dung Nguyên, Rafal Stefanski
2024 J jnl
Function spaces for orbit-finite sets.
CoRR
Mikolaj Bojanczyk, Lê Thành Dung Nguyên, Rafal Stefanski
2024 J jnl
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata.
TheoretiCS
Mikolaj Bojanczyk, Joanna Fijalkow, Bartek Klin, Joshua Moerman
2024 J jnl
Polyregular Functions on Unordered Trees of Bounded Height.
Proc. ACM Program. Lang.
Mikolaj Bojanczyk, Bartek Klin
2024 A* conf
Rank-decreasing transductions.
LICS
Mikolaj Bojanczyk, Pierre Ohlmann
2024 J jnl
Rank-decreasing transductions.
CoRR
Mikolaj Bojanczyk, Pierre Ohlmann
2023 A* conf
Algebraic Recognition of Regular Functions.
ICALP
Mikolaj Bojanczyk, Lê Thành Dung Nguyên
2023 A* conf
Folding interpretations.
LICS
Mikolaj Bojanczyk
2023 J jnl
Folding interpretations.
CoRR
Mikolaj Bojanczyk
2023 A* conf
On the Growth Rates of Polyregular Functions.
LICS
Mikolaj Bojanczyk
2023 J jnl
Polyregular functions on unordered trees of bounded height.
CoRR
Mikolaj Bojanczyk, Bartek Klin
2023 J jnl
Presburger Award 2023 - Laudatio.
Bull. EATCS
Mikolaj Bojanczyk
2023 J jnl
Regular Transformations (Dagstuhl Seminar 23202).
Dagstuhl Reports
Rajeev Alur, Mikolaj Bojanczyk, Emmanuel Filiot, Anca Muscholl, Sarah Winter
2023 J jnl
The category of MSO transductions.
CoRR
Mikolaj Bojanczyk
2022 A* ed.
49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, Paris, France, July 4-8, 2022
ICALP
Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff
2022 J jnl
Monadic Monadic Second Order Logic.
CoRR
Mikolaj Bojanczyk, Bartek Klin, Julian Salamanca
2022 J jnl
On the growth rate of polyregular functions.
CoRR
Mikolaj Bojanczyk
2022 J jnl
Optimizing tree decompositions in MSO.
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Michal Pilipczuk
2022 J jnl
The Presburger Award for Young Scientists 2023 - Call for Nominations.
Bull. EATCS
Mikolaj Bojanczyk
2022 A* conf
Transducers of polynomial growth.
LICS
Mikolaj Bojanczyk
2021 — ed.
41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, Virtual Conference, December 15-17, 2021
FSTTCS
Mikolaj Bojanczyk, Chandra Chekuri
2021 — ch.
Algebra for trees.
Handbook of Automata Theory (I.)
Mikolaj Bojanczyk
2021 J jnl
Definable decompositions for graphs of bounded linear cliquewidth.
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
2021 J jnl
EATCS-Fellows 2021.
Bull. EATCS
Mikolaj Bojanczyk
2021 J jnl
ICALP 2022 - 49th EATCS International Colloquium on Automata, Languages and Programming.
Bull. EATCS
David P. Woodruff, Mikolaj Bojanczyk
2021 A* conf
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata.
LICS
Mikolaj Bojanczyk, Bartek Klin, Joshua Moerman
2021 J jnl
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata.
CoRR
Mikolaj Bojanczyk, Bartek Klin, Joshua Moerman
2021 J jnl
Preface.
Inf. Comput.
Mikolaj Bojanczyk, Thomas Brihaye, Christoph Haase, Slawomir Lasota, Joël Ouaknine, Igor Potapov
2021 J jnl
Separator logic and star-free expressions for graphs.
CoRR
Mikolaj Bojanczyk
2020 J jnl
EATCS Fellows 2021 - Call for Nominations.
Bull. EATCS
Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano
2020 A* conf
Extensions of ω-Regular Languages.
LICS
Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche
2020 J jnl
Extensions of ω-Regular Languages.
CoRR
Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche
2020 A* conf
First-order tree-to-tree functions.
LICS
Mikolaj Bojanczyk, Amina Doumane
2020 J jnl
First-order tree-to-tree functions.
CoRR
Mikolaj Bojanczyk, Amina Doumane
2020 J jnl
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.
CoRR
Mikolaj Bojanczyk
2020 A* conf
Single-Use Automata and Transducers for Infinite Alphabets.
ICALP
Mikolaj Bojanczyk, Rafal Stefanski
2020 B conf
Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers.
MFCS
Mikolaj Bojanczyk, Janusz Schmude
2020 J jnl
The Presburger Award for Young Scientists 2021 - Call for Nominations.
Bull. EATCS
Thore Husfeldt, Meena Mahajan, Mikolaj Bojanczyk
2020 J jnl
Undecidability of a weak version of MSO+U.
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith
2019 J jnl
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra.
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Bartek Klin
2019 J jnl
Automata Column.
ACM SIGLOG News
Mikolaj Bojanczyk
2019 J jnl
EATCS Fellows 2020 - Call for Nominations.
Bull. EATCS
Christel Baier, Mikolaj Bojanczyk, Mariangiola Dezani, Josep Díaz, Giuseppe F. Italiano
2019 B ed.
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
FoSSaCS
Mikolaj Bojanczyk, Alex Simpson
2019 J jnl
MSO+nabla is undecidable.
CoRR
Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak
2019 A* conf
MSO+∇ is undecidable.
LICS
Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak
2019 J jnl
Regular tree languages in low levels of the Wadge Hierarchy.
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak
2019 J jnl
Single use register automata for data words.
CoRR
Mikolaj Bojanczyk, Rafal Stefanski
2019 A* conf
String-to-String Interpretations With Polynomial-Size Output.
ICALP
Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote
2019 J jnl
String-to-String Interpretations with Polynomial-Size Output.
CoRR
Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote
2019 J jnl
The Hilbert method for transducer equivalence.
ACM SIGLOG News
Mikolaj Bojanczyk
2018 J jnl
A non-regular language of infinite trees that is recognizable by a finite algebra.
CoRR
Mikolaj Bojanczyk, Bartek Klin
2018 J jnl
Automata column.
ACM SIGLOG News
Mikolaj Bojanczyk
2018 J jnl
Automata column.
ACM SIGLOG News
Mikolaj Bojanczyk
2018 J jnl
Automata column.
ACM SIGLOG News
Mikolaj Bojanczyk
2018 A* conf
Definable decompositions for graphs of bounded linear cliquewidth.
LICS
Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
2018 J jnl
Definable decompositions for graphs of bounded linear cliquewidth.
CoRR
Mikolaj Bojanczyk, Martin Grohe, Michal Pilipczuk
2018 A* conf
On computability and tractability for infinite sets.
LICS
Mikolaj Bojanczyk, Szymon Torunczyk
2018 J jnl
Polyregular Functions.
CoRR
Mikolaj Bojanczyk
2018 J jnl
Regular and First Order List Functions.
CoRR
Mikolaj Bojanczyk, Laure Daviaud, S. Krishna
2018 A* conf
Regular and First-Order List Functions.
LICS
Mikolaj Bojanczyk, Laure Daviaud, Shankara Narayanan Krishna
2018 J jnl
Regular tree languages in low levels of Wadge Hierarchy.
CoRR
Mikolaj Bojanczyk, Filippo Cavallari, Thomas Place, Michal Skrzypczak
2018 J jnl
Two monads for graphs.
CoRR
Mikolaj Bojanczyk
2018 J jnl
Undecidability of MSO+"ultimately periodic".
CoRR
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith
2017 J jnl
Automata column.
ACM SIGLOG News
Mikolaj Bojanczyk
2017 J jnl
Automata column.
ACM SIGLOG News
Mikolaj Bojanczyk
2017 J jnl
Automata column.
ACM SIGLOG News
Mikolaj Bojanczyk
2017 J jnl
Boundedness in languages of infinite words.
CoRR
Mikolaj Bojanczyk, Thomas Colcombet
2017 J jnl
Boundedness in languages of infinite words.
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Thomas Colcombet
2017 A* conf
Emptiness of Zero Automata Is Decidable.
ICALP
Mikolaj Bojanczyk, Hugo Gimbert, Edon Kelmendi
2017 J jnl
Emptiness of zero automata is decidable.
CoRR
Mikolaj Bojanczyk, Hugo Gimbert, Edon Kelmendi
2017 J jnl
It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton.
Fundam. Informaticae
Mikolaj Bojanczyk
2017 J jnl
It is undecidable if two regular tree languages can be separated by a deterministic tree-walking automaton.
CoRR
Mikolaj Bojanczyk
2017 A conf
Optimizing Tree Decompositions in MSO.
STACS
Mikolaj Bojanczyk, Michal Pilipczuk
2017 J jnl
Optimizing tree decompositions in MSO.
CoRR
Mikolaj Bojanczyk, Michal Pilipczuk
2017 A* conf
Orbit-Finite Sets and Their Algorithms (Invited Talk).
ICALP
Mikolaj Bojanczyk
2017 J jnl
Some connections between universal algebra and logics for trees.
CoRR
Mikolaj Bojanczyk, Henryk Michalewski
2017 J jnl
Star Height via Games.
CoRR
Mikolaj Bojanczyk
2017 A* conf
Which Classes of Origin Graphs Are Generated by Transducers.
ICALP
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle
2016 J jnl
Automata column.
ACM SIGLOG News
Mikolaj Bojanczyk
2016 J jnl
Automata column.
ACM SIGLOG News
Mikolaj Bojanczyk
2016 J jnl
Automata column.
ACM SIGLOG News
Mikolaj Bojanczyk
2016 B conf
Decidable Extensions of MSO.
MFCS
Mikolaj Bojanczyk
2016 A* conf
Definability equals recognizability for graphs of bounded treewidth.
LICS
Mikolaj Bojanczyk, Michal Pilipczuk
2016 J jnl
Definability equals recognizability for graphs of bounded treewidth.
CoRR
Mikolaj Bojanczyk, Michal Pilipczuk
2016 — conf
On the Regular Emptiness Problem of Subzero Automata.
ICE
Henryk Michalewski, Matteo Mio, Mikolaj Bojanczyk
2016 J jnl
Regular Languages of Thin Trees.
Theory Comput. Syst.
Tomasz Idziaszek, Michal Skrzypczak, Mikolaj Bojanczyk
2016 A conf
The MSO+U Theory of (N, <) Is Undecidable.
STACS
Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk
2016 A* conf
Thin MSO with a Probabilistic Path Quantifier.
ICALP
Mikolaj Bojanczyk
2015 J jnl
Automata column.
ACM SIGLOG News
Mikolaj Bojanczyk
2015 J jnl
Automata column.
ACM SIGLOG News
Mikolaj Bojanczyk
2015 J jnl
Circuits, Logic and Games (Dagstuhl Seminar 15401).
Dagstuhl Reports
Mikolaj Bojanczyk, Meena Mahajan, Thomas Schwentick, Heribert Vollmer
2015 — conf
Containment of Monadic Datalog Programs via Bounded Clique-Width.
ICALP (2)
Mikolaj Bojanczyk, Filip Murlak, Adam Witkowski
2015 J jnl
McNaughton's theorem.
ACM SIGLOG News
Mikolaj Bojanczyk
2015 — ed.
Reachability Problems - 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings
RP
Mikolaj Bojanczyk, Slawomir Lasota, Igor Potapov
2015 C conf
Recognisable Languages over Monads.
DLT
Mikolaj Bojanczyk
2015 J jnl
Recognisable languages over monads.
CoRR
Mikolaj Bojanczyk
2015 A* conf
Star Height via Games.
LICS
Mikolaj Bojanczyk
2015 J jnl
The MSO+U theory of (N, <) is undecidable.
CoRR
Mikolaj Bojanczyk, Pawel Parys, Szymon Torunczyk
2014 J jnl
Automata column.
ACM SIGLOG News
Mikolaj Bojanczyk
2014 J jnl
Automata column.
ACM SIGLOG News
Mikolaj Bojanczyk
2014 J jnl
Automata theory in nominal sets.
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
2014 J jnl
Decomposition Theorems and Model-Checking for the Modal $μ$-Calculus.
CoRR
Mikolaj Bojanczyk, Christoph Dittmann, Stephan Kreutzer
2014 — conf
Decomposition theorems and model-checking for the modal
CSL-LICS
Mikolaj Bojanczyk, Christoph Dittmann, Stephan Kreutzer
2014 — conf
On the Decidability of MSO+U on Infinite Trees.
ICALP (2)
Mikolaj Bojanczyk, Tomasz Gogacz, Henryk Michalewski, Michal Skrzypczak
2014 J jnl
Rigidity is undecidable.
Math. Struct. Comput. Sci.
Mikolaj Bojanczyk, Stanislaw Szawiel, Marek W. Zawadowski
2014 — conf
Transducers with Origin Information.
ICALP (2)
Mikolaj Bojanczyk
2014 — conf
Weak MSO+U with Path Quantifiers over Infinite Trees.
ICALP (2)
Mikolaj Bojanczyk
2014 J jnl
Weak MSO+U with Path Quantifiers over Infinite Trees.
CoRR
Mikolaj Bojanczyk
2013 B conf
Automata and Algebras for Infinite Words and Trees.
CALCO
Mikolaj Bojanczyk
2013 C conf
Modelling Infinite Structures with Atoms.
WoLLIC
Mikolaj Bojanczyk
2013 J jnl
Nominal Computation Theory (Dagstuhl Seminar 13422).
Dagstuhl Reports
Mikolaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts
2013 J jnl
Nominal Monoids.
Theory Comput. Syst.
Mikolaj Bojanczyk
2013 A conf
Regular languages of thin trees.
STACS
Mikolaj Bojanczyk, Tomasz Idziaszek, Michal Skrzypczak
2013 J jnl
Solutions in XML data exchange.
J. Comput. Syst. Sci.
Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak
2013 J jnl
Transducers with origin information.
CoRR
Mikolaj Bojanczyk
2013 A* conf
Turing Machines with Atoms.
LICS
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk
2013 A* conf
Verification of database-driven systems via amalgamation.
PODS
Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk
2012 — conf
A Machine-Independent Characterization of Timed Languages.
ICALP (2)
Mikolaj Bojanczyk, Slawomir Lasota
2012 J jnl
Algorithms for regular languages that use algebra.
SIGMOD Rec.
Mikolaj Bojanczyk
2012 J jnl
An extension of data automata that captures XPath
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Slawomir Lasota
2012 — conf
Decidable classes of documents for XPath.
FSTTCS
Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys
2012 J jnl
Finite satisfiability for guarded fixpoint logic.
Inf. Process. Lett.
Vince Bárány, Mikolaj Bojanczyk
2012 — conf
Fraenkel-Mostowski Sets with Non-homogeneous Atoms.
RP
Mikolaj Bojanczyk, Slawomir Lasota
2012 — conf
Imperative Programming in Sets with Atoms.
FSTTCS
Mikolaj Bojanczyk, Szymon Torunczyk
2012 J jnl
Minimization of semilinear automata
CoRR
Mikolaj Bojanczyk, Slawomir Lasota
2012 J jnl
Piecewise testable tree languages
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing
2012 — conf
Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets.
ICALP (2)
Mikolaj Bojanczyk, Thomas Place
2012 J jnl
Rigidity is undecidable
CoRR
Mikolaj Bojanczyk, Stanislaw Szawiel, Marek W. Zawadowski
2012 — conf
Toward Model Theory with Data Values.
ICALP (2)
Mikolaj Bojanczyk, Thomas Place
2012 A* conf
Towards nominal computation.
POPL
Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota
2012 A conf
Weak MSO+U over infinite trees.
STACS
Mikolaj Bojanczyk, Szymon Torunczyk
2012 J jnl
Wreath Products of Forest Algebras, with Applications to Tree Logics
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz
2011 A* conf
Automata with Group Actions.
LICS
Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota
2011 A conf
Data Monoids.
STACS
Mikolaj Bojanczyk
2011 A* conf
Efficient evaluation for a temporal logic on changing XML documents.
PODS
Mikolaj Bojanczyk, Diego Figueira
2011 J jnl
Finite Satisfiability for Guarded Fixpoint Logic
CoRR
Vince Bárány, Mikolaj Bojanczyk
2011 J jnl
Foreword.
Theory Comput. Syst.
Albert Atserias, Mikolaj Bojanczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, Kenneth A. Ross
2011 A conf
Solutions in XML data exchange.
ICDT
Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak
2011 J jnl
Two-variable logic on data words.
ACM Trans. Comput. Log.
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin
2011 J jnl
Weak MSO with the Unbounding Quantifier.
Theory Comput. Syst.
Mikolaj Bojanczyk
2011 J jnl
XPath evaluation in linear time.
J. ACM
Mikolaj Bojanczyk, Pawel Parys
2010 A* conf
An Extension of Data Automata that Captures XPath.
LICS
Mikolaj Bojanczyk, Slawomir Lasota
2010 — conf
Automata for Data Words and Data Trees.
RTA
Mikolaj Bojanczyk
2010 A conf
Beyond omega-Regular Languages.
STACS
Mikolaj Bojanczyk
2010 — conf
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests.
ICALP (1)
Mikolaj Bojanczyk, Pawel Parys
2010 J jnl
On the Borel Complexity of MSO Definable Sets of Branches.
Fundam. Informaticae
Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak
2010 J jnl
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
Log. Methods Comput. Sci.
Mikolaj Bojanczyk, Luc Segoufin
2009 B conf
Algebra for Infinite Forests with an Application to the Temporal Logic EF.
CONCUR
Mikolaj Bojanczyk, Tomasz Idziaszek
2009 B conf
Algebra for Tree Languages.
CSL
Mikolaj Bojanczyk
2009 — conf
Deterministic Automata and Extensions of Weak MSO.
FSTTCS
Mikolaj Bojanczyk, Szymon Torunczyk
2009 C conf
Factorization Forests.
Developments in Language Theory
Mikolaj Bojanczyk
2009 J jnl
Two-Way Unary Temporal Logic over Trees
Log. Methods Comput. Sci.
Mikolaj Bojanczyk
2009 J jnl
Two-variable logic on data trees and XML reasoning.
J. ACM
Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin
2009 A conf
Weak MSO with the Unbounding Quantifier.
STACS
Mikolaj Bojanczyk
2009 J jnl
Weak Mso with the Unbounding Quantifier
CoRR
Mikolaj Bojanczyk
2009 A* conf
Wreath Products of Forest Algebras, with Applications to Tree Logics.
LICS
Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz
2008 A* conf
Effective characterizations of tree logics.
PODS
Mikolaj Bojanczyk
2008 — conf
Forest algebras.
Logic and Automata
Mikolaj Bojanczyk, Igor Walukiewicz
2008 A* conf
Piecewise Testable Tree Languages.
LICS
Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing
2008 B conf
The Common Fragment of ACTL and LTL.
FoSSaCS
Mikolaj Bojanczyk
2008 — conf
Tree Languages Defined in First-Order Logic with One Quantifier Alternation.
ICALP (2)
Mikolaj Bojanczyk, Luc Segoufin
2008 J jnl
Tree-Walking Automata Do Not Recognize All Regular Languages.
SIAM J. Comput.
Mikolaj Bojanczyk, Thomas Colcombet
2008 C conf
Tree-Walking Automata.
LATA
Mikolaj Bojanczyk
2008 A* conf
XPath evaluation in linear time.
PODS
Mikolaj Bojanczyk, Pawel Parys
2007 J jnl
A new algorithm for testing if a regular language is locally threshold testable.
Inf. Process. Lett.
Mikolaj Bojanczyk
2007 A* conf
Bounded Depth Data Trees.
ICALP
Henrik Björklund, Mikolaj Bojanczyk
2007 B conf
Forest Expressions.
CSL
Mikolaj Bojanczyk
2007 A conf
Reachability in Unions of Commutative Rewriting Systems Is Decidable.
STACS
Mikolaj Bojanczyk, Piotr Hoffman
2007 B conf
Shuffle Expressions and Words with Nested Data.
MFCS
Henrik Björklund, Mikolaj Bojanczyk
2007 A* conf
Two-way unary temporal logic over trees.
LICS
Mikolaj Bojanczyk
2006 A* conf
Bounds in w-Regularity.
LICS
Mikolaj Bojanczyk, Thomas Colcombet
2006 J jnl
Characterizing EF and EX tree logics.
Theor. Comput. Sci.
Mikolaj Bojanczyk, Igor Walukiewicz
2006 — conf
Expressive Power of Pebble Automata.
ICALP (1)
Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin
2006 J jnl
Tree-walking automata cannot be determinized.
Theor. Comput. Sci.
Mikolaj Bojanczyk, Thomas Colcombet
2006 A* conf
Two-Variable Logic on Words with Data.
LICS
Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David
2006 A* conf
Two-variable logic on data trees and XML reasoning.
PODS
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin
2005 A* conf
Tree-walking automata do not recognize all regular languages.
STOC
Mikolaj Bojanczyk, Thomas Colcombet
2004 B conf
A Bounding Quantifier.
CSL
Mikolaj Bojanczyk
2004 B conf
Characterizing EF and EX Tree Logics.
CONCUR
Mikolaj Bojanczyk, Igor Walukiewicz
2004 A* conf
Tree-Walking Automata Cannot Be Determinized.
ICALP
Mikolaj Bojanczyk, Thomas Colcombet
2003 — conf
1-Bounded TWA Cannot Be Determinized.
FSTTCS
Mikolaj Bojanczyk
2003 J jnl
The finite graph problem for two-way alternating automata.
Theor. Comput. Sci.
Mikolaj Bojanczyk
2002 A* conf
Two-Way Alternating Automata and Finite Models.
ICALP
Mikolaj Bojanczyk
2001 B conf
The Finite Graph Problem for Two-Way Alternating Automata.
FoSSaCS
Mikolaj Bojanczyk