×

zbMATH — the first resource for mathematics

Bojańczyk, Mikołaj

Compute Distance To:
Author ID: bojanczyk.mikolaj Recent zbMATH articles by "Bojańczyk, Mikołaj"
Published as: Bojanczyk, Mikolaj; Bojanczyk, Mikołaj; Bojañczyk, Mikołaj; Bojańczyk, Mikolaj; Bojańczyk, Mikołaj; Bojánczyk, Mikolaj; Bojánczyk, Mikołaj
Homepage: https://www.mimuw.edu.pl/~bojan/
External Links: MGP · Wikidata · dblp · GND
Documents Indexed: 85 Publications since 2001, including 2 Books

Publications by Year

Citations contained in zbMATH Open

60 Publications have been cited 284 times in 188 Documents Cited by Year
Two-variable logic on data words. Zbl 1352.03041
Bojańczyk, Mikołaj; David, Claire; Muscholl, Anca; Schwentick, Thomas; Segoufin, Luc
38
2011
Two-variable logic on data trees and XML reasoning. Zbl 1325.68078
Bojańczyk, Mikolaj; Muscholl, Anca; Schwentick, Thomas; Segoufin, Luc
28
2009
Automata theory in nominal sets. Zbl 1338.68140
Bojańczyk, Mikołaj; Klin, Bartek; Lasota, Sławomir
13
2014
Towards nominal computation. Zbl 1321.68139
Bojanczyk, Mikolaj; Braud, Laurent; Klin, Bartek; Lasota, Slawomir
11
2012
Transducers with origin information. Zbl 1409.68152
Bojańczyk, Mikołaj
9
2014
Recognisable languages over monads. Zbl 1434.68307
Bojańczyk, Mikołaj
8
2015
Forest algebras. Zbl 1217.68123
Bojańczyk, Mikołaj; Walukiewicz, Igor
8
2008
Tree-walking automata. Zbl 1156.68445
Bojańczyk, Mikołaj
8
2008
Expressive power of pebble automata. Zbl 1223.68065
Bojańczyk, Mikołaj; Samuelides, Mathias; Schwentick, Thomas; Segoufin, Luc
8
2006
Weak MSO with the unbounding quantifier. Zbl 1227.03051
Bojańczyk, Mikołaj
7
2011
Algebra for infinite forests with an application to the temporal logic EF. Zbl 1254.68158
Bojańczyk, Mikołaj; Idziaszek, Tomasz
7
2009
Tree-walking automata do not recognize all regular languages. Zbl 1172.68030
Bojańczyk, Mikołaj; Colcombet, Thomas
7
2009
Characterizing EF and EX tree logics. Zbl 1097.03013
Bojańczyk, Mikolaj; Walukiewicz, Igor
7
2006
Turing machines with atoms. Zbl 1367.68098
Bojánczyk, Mikolaj; Klin, Bartek; Lasota, Sławomir; Toruńczyk, Szymon
6
2013
Tree-walking automata do not recognize all regular languages. Zbl 1192.68406
Bojanczyk, Mikolaj; Colcombet, Thomas
6
2005
Characterizing EF and EX tree logics. Zbl 1097.03504
Bojańczyk, Mikołaj; Walukiewicz, Igor
6
2004
Regular languages of infinite trees that are Boolean combinations of open sets. Zbl 1367.68160
Bojańczyk, Mikołaj; Place, Thomas
5
2012
Piecewise testable tree languages. Zbl 1261.03126
Bojańczyk, Mikołaj; Segoufin, Luc; Straubing, Howard
5
2012
Weak \(\text{MSO}+U\) over infinite trees. Zbl 1245.68119
Bojańczyk, Mikolaj; Toruńczyk, Szymon
5
2012
The common fragment of ACTL and LTL. Zbl 1139.68036
Bojańczyk, Mikołaj
5
2008
Tree-walking automata cannot be determinized. Zbl 1086.68070
Bojańczyk, Mikołaj; Colcombet, Thomas
5
2006
A bounding quantifier. Zbl 1095.03007
Bojańczyk, Mikołaj
5
2004
Definability equals recognizability for graphs of bounded treewidth. Zbl 1394.03062
Bojańczyk, Mikołaj; Pilipczuk, Michał
4
2016
Shuffle expressions and words with nested data. Zbl 1147.68554
Björklund, Henrik; Bojańczyk, Mikołaj
4
2007
Tree-walking automata cannot be determinized. Zbl 1098.68620
Bojańczyk, Mikołaj; Colcombet, Thomas
4
2004
Boundedness in languages of infinite words. Zbl 1459.68095
Bojańczyk, Mikołaj; Colcombet, Thomas
3
2017
The MSO+U theory of \((\mathbb N,<)\) is undecidable. Zbl 1388.03016
Bojanczyk, Mikolaj; Parys, Pawel; Torunczyk, Szymon
3
2016
On the decidability of MSO+U on infinite trees. Zbl 1407.03007
Bojańczyk, Mikołaj; Gogacz, Tomasz; Michalewski, Henryk; Skrzypczak, Michał
3
2014
An extension of data automata that captures XPath. Zbl 1241.68077
Bojańczyk, Mikołaj; Lasota, Sławomir
3
2012
XPath evaluation in linear time. Zbl 1281.68093
Bojańczyk, Mikołaj; Parys, Paweł
3
2011
Data monoids. Zbl 1230.68146
Bojańczyk, Mikolaj
3
2011
Deterministic automata and extensions of weak MSO. Zbl 1248.68285
Bojańczyk, Mikołaj; Toruńczyk, Szymon
3
2009
Tree languages defined in first-order logic with one quantifier alternation. Zbl 1170.03019
Bojańczyk, Mikołaj; Segoufin, Luc
3
2008
Forest expressions. Zbl 1179.68068
Bojańczyk, Mikołaj
3
2007
Two-way alternating automata and finite models. Zbl 1057.03029
Bojańczyk, Mikołaj
3
2002
Which classes of origin graphs are generated by transducers. Zbl 1442.68083
Bojańczyk, Mikołaj; Daviaud, Laure; Guillon, Bruno; Penelle, Vincent
2
2017
Containment of monadic Datalog programs via bounded clique-width. Zbl 1440.68054
Bojańczyk, Mikołaj; Murlak, Filip; Witkowski, Adam
2
2015
Weak MSO+U with path quantifiers over infinite trees. Zbl 1407.03006
Bojańczyk, Mikołaj
2
2014
Regular languages of thin trees. Zbl 1354.68146
Bojańczyk, Mikołaj; Idziaszek, Tomasz; Skrzypczak, Michał
2
2013
Nominal monoids. Zbl 1295.68163
Bojańczyk, Mikołaj
2
2013
A machine-independent characterization of timed languages. Zbl 1367.68159
Bojańczyk, Mikołaj; Lasota, Sławomir
2
2012
Wreath products of forest algebras, with applications to tree logics. Zbl 1258.03044
Bojańczyk, Mikolaj; Walukiewicz, Igor; Straubing, Howard
2
2012
On the Borel complexity of MSO definable sets of branches. Zbl 1206.03041
Bojańczyk, Mikołaj; Niwiński, Damian; Rabinovich, Alexander; Radziwończyk-Syta, Adam; Skrzypczak, Michał
2
2010
Bounded depth data trees. Zbl 1171.68432
Björklund, Henrik; Bojańczyk, Mikołaj
2
2007
1-bounded TWA cannot be determinized. Zbl 1205.68193
Bojañczyk, Mikołaj
2
2003
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra. Zbl 1427.68178
Bojańczyk, Mikołaj; Klin, Bartek
1
2019
Optimizing tree decompositions in MSO. Zbl 1402.68140
Bojańczyk, Mikołaj; Pilipczuk, Michał
1
2017
Regular languages of thin trees. Zbl 1350.68173
Idziaszek, Tomasz; Skrzypczak, Michał; Bojańczyk, Mikołaj
1
2016
Star height via games. Zbl 1401.68148
Bojańczyk, Mikolaj
1
2015
Decomposition theorems and model-checking for the modal \(\mu\)-calculus. Zbl 1394.68222
Bojanczyk, Mikolaj; Dittmann, Christoph; Kreutzer, Stephan
1
2014
Solutions in XML data exchange. Zbl 1408.68045
Bojańczyk, Mikołaj; Kołodziejczyk, Leszek A.; Murlak, Filip
1
2013
Modelling infinite structures with atoms. Zbl 1394.03055
Bojańczyk, Mikołaj
1
2013
Imperative programming in sets with atoms. Zbl 1354.68053
Bojańczyk, Mikolaj; Toruńczyk, Szymon
1
2012
Toward model theory with data values. Zbl 1367.03051
Bojańczyk, Mikołaj; Place, Thomas
1
2012
Finite satisfiability for guarded fixpoint logic. Zbl 1243.68191
Bárány, Vince; Bojańczyk, Mikołaj
1
2012
Beyond \(\omega\)-regular languages. Zbl 1230.68124
Bojańczyk, Mikołaj
1
2010
Factorization forests. Zbl 1247.68127
Bojańczyk, Mikołaj
1
2009
A new algorithm for testing if a regular language is locally threshold testable. Zbl 1184.68307
Bojańczyk, Mikołaj
1
2007
Reachability in unions of commutative rewriting systems is decidable. Zbl 1186.68231
Bojańczyk, Mikołaj; Hoffman, Piotr
1
2007
The finite graph problem for two-way alternating automata. Zbl 1052.68069
Bojańczyk, Mikołaj
1
2003
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra. Zbl 1427.68178
Bojańczyk, Mikołaj; Klin, Bartek
1
2019
Boundedness in languages of infinite words. Zbl 1459.68095
Bojańczyk, Mikołaj; Colcombet, Thomas
3
2017
Which classes of origin graphs are generated by transducers. Zbl 1442.68083
Bojańczyk, Mikołaj; Daviaud, Laure; Guillon, Bruno; Penelle, Vincent
2
2017
Optimizing tree decompositions in MSO. Zbl 1402.68140
Bojańczyk, Mikołaj; Pilipczuk, Michał
1
2017
Definability equals recognizability for graphs of bounded treewidth. Zbl 1394.03062
Bojańczyk, Mikołaj; Pilipczuk, Michał
4
2016
The MSO+U theory of \((\mathbb N,<)\) is undecidable. Zbl 1388.03016
Bojanczyk, Mikolaj; Parys, Pawel; Torunczyk, Szymon
3
2016
Regular languages of thin trees. Zbl 1350.68173
Idziaszek, Tomasz; Skrzypczak, Michał; Bojańczyk, Mikołaj
1
2016
Recognisable languages over monads. Zbl 1434.68307
Bojańczyk, Mikołaj
8
2015
Containment of monadic Datalog programs via bounded clique-width. Zbl 1440.68054
Bojańczyk, Mikołaj; Murlak, Filip; Witkowski, Adam
2
2015
Star height via games. Zbl 1401.68148
Bojańczyk, Mikolaj
1
2015
Automata theory in nominal sets. Zbl 1338.68140
Bojańczyk, Mikołaj; Klin, Bartek; Lasota, Sławomir
13
2014
Transducers with origin information. Zbl 1409.68152
Bojańczyk, Mikołaj
9
2014
On the decidability of MSO+U on infinite trees. Zbl 1407.03007
Bojańczyk, Mikołaj; Gogacz, Tomasz; Michalewski, Henryk; Skrzypczak, Michał
3
2014
Weak MSO+U with path quantifiers over infinite trees. Zbl 1407.03006
Bojańczyk, Mikołaj
2
2014
Decomposition theorems and model-checking for the modal \(\mu\)-calculus. Zbl 1394.68222
Bojanczyk, Mikolaj; Dittmann, Christoph; Kreutzer, Stephan
1
2014
Turing machines with atoms. Zbl 1367.68098
Bojánczyk, Mikolaj; Klin, Bartek; Lasota, Sławomir; Toruńczyk, Szymon
6
2013
Regular languages of thin trees. Zbl 1354.68146
Bojańczyk, Mikołaj; Idziaszek, Tomasz; Skrzypczak, Michał
2
2013
Nominal monoids. Zbl 1295.68163
Bojańczyk, Mikołaj
2
2013
Solutions in XML data exchange. Zbl 1408.68045
Bojańczyk, Mikołaj; Kołodziejczyk, Leszek A.; Murlak, Filip
1
2013
Modelling infinite structures with atoms. Zbl 1394.03055
Bojańczyk, Mikołaj
1
2013
Towards nominal computation. Zbl 1321.68139
Bojanczyk, Mikolaj; Braud, Laurent; Klin, Bartek; Lasota, Slawomir
11
2012
Regular languages of infinite trees that are Boolean combinations of open sets. Zbl 1367.68160
Bojańczyk, Mikołaj; Place, Thomas
5
2012
Piecewise testable tree languages. Zbl 1261.03126
Bojańczyk, Mikołaj; Segoufin, Luc; Straubing, Howard
5
2012
Weak \(\text{MSO}+U\) over infinite trees. Zbl 1245.68119
Bojańczyk, Mikolaj; Toruńczyk, Szymon
5
2012
An extension of data automata that captures XPath. Zbl 1241.68077
Bojańczyk, Mikołaj; Lasota, Sławomir
3
2012
A machine-independent characterization of timed languages. Zbl 1367.68159
Bojańczyk, Mikołaj; Lasota, Sławomir
2
2012
Wreath products of forest algebras, with applications to tree logics. Zbl 1258.03044
Bojańczyk, Mikolaj; Walukiewicz, Igor; Straubing, Howard
2
2012
Imperative programming in sets with atoms. Zbl 1354.68053
Bojańczyk, Mikolaj; Toruńczyk, Szymon
1
2012
Toward model theory with data values. Zbl 1367.03051
Bojańczyk, Mikołaj; Place, Thomas
1
2012
Finite satisfiability for guarded fixpoint logic. Zbl 1243.68191
Bárány, Vince; Bojańczyk, Mikołaj
1
2012
Two-variable logic on data words. Zbl 1352.03041
Bojańczyk, Mikołaj; David, Claire; Muscholl, Anca; Schwentick, Thomas; Segoufin, Luc
38
2011
Weak MSO with the unbounding quantifier. Zbl 1227.03051
Bojańczyk, Mikołaj
7
2011
XPath evaluation in linear time. Zbl 1281.68093
Bojańczyk, Mikołaj; Parys, Paweł
3
2011
Data monoids. Zbl 1230.68146
Bojańczyk, Mikolaj
3
2011
On the Borel complexity of MSO definable sets of branches. Zbl 1206.03041
Bojańczyk, Mikołaj; Niwiński, Damian; Rabinovich, Alexander; Radziwończyk-Syta, Adam; Skrzypczak, Michał
2
2010
Beyond \(\omega\)-regular languages. Zbl 1230.68124
Bojańczyk, Mikołaj
1
2010
Two-variable logic on data trees and XML reasoning. Zbl 1325.68078
Bojańczyk, Mikolaj; Muscholl, Anca; Schwentick, Thomas; Segoufin, Luc
28
2009
Algebra for infinite forests with an application to the temporal logic EF. Zbl 1254.68158
Bojańczyk, Mikołaj; Idziaszek, Tomasz
7
2009
Tree-walking automata do not recognize all regular languages. Zbl 1172.68030
Bojańczyk, Mikołaj; Colcombet, Thomas
7
2009
Deterministic automata and extensions of weak MSO. Zbl 1248.68285
Bojańczyk, Mikołaj; Toruńczyk, Szymon
3
2009
Factorization forests. Zbl 1247.68127
Bojańczyk, Mikołaj
1
2009
Forest algebras. Zbl 1217.68123
Bojańczyk, Mikołaj; Walukiewicz, Igor
8
2008
Tree-walking automata. Zbl 1156.68445
Bojańczyk, Mikołaj
8
2008
The common fragment of ACTL and LTL. Zbl 1139.68036
Bojańczyk, Mikołaj
5
2008
Tree languages defined in first-order logic with one quantifier alternation. Zbl 1170.03019
Bojańczyk, Mikołaj; Segoufin, Luc
3
2008
Shuffle expressions and words with nested data. Zbl 1147.68554
Björklund, Henrik; Bojańczyk, Mikołaj
4
2007
Forest expressions. Zbl 1179.68068
Bojańczyk, Mikołaj
3
2007
Bounded depth data trees. Zbl 1171.68432
Björklund, Henrik; Bojańczyk, Mikołaj
2
2007
A new algorithm for testing if a regular language is locally threshold testable. Zbl 1184.68307
Bojańczyk, Mikołaj
1
2007
Reachability in unions of commutative rewriting systems is decidable. Zbl 1186.68231
Bojańczyk, Mikołaj; Hoffman, Piotr
1
2007
Expressive power of pebble automata. Zbl 1223.68065
Bojańczyk, Mikołaj; Samuelides, Mathias; Schwentick, Thomas; Segoufin, Luc
8
2006
Characterizing EF and EX tree logics. Zbl 1097.03013
Bojańczyk, Mikolaj; Walukiewicz, Igor
7
2006
Tree-walking automata cannot be determinized. Zbl 1086.68070
Bojańczyk, Mikołaj; Colcombet, Thomas
5
2006
Tree-walking automata do not recognize all regular languages. Zbl 1192.68406
Bojanczyk, Mikolaj; Colcombet, Thomas
6
2005
Characterizing EF and EX tree logics. Zbl 1097.03504
Bojańczyk, Mikołaj; Walukiewicz, Igor
6
2004
A bounding quantifier. Zbl 1095.03007
Bojańczyk, Mikołaj
5
2004
Tree-walking automata cannot be determinized. Zbl 1098.68620
Bojańczyk, Mikołaj; Colcombet, Thomas
4
2004
1-bounded TWA cannot be determinized. Zbl 1205.68193
Bojañczyk, Mikołaj
2
2003
The finite graph problem for two-way alternating automata. Zbl 1052.68069
Bojańczyk, Mikołaj
1
2003
Two-way alternating automata and finite models. Zbl 1057.03029
Bojańczyk, Mikołaj
3
2002
all top 5

Cited by 286 Authors

10 Bojańczyk, Mikołaj
8 Skrzypczak, Michał
7 Lasota, Sławomir
5 Demri, Stéphane P.
5 Engelfriet, Joost
5 Ésik, Zoltán
5 Gastin, Paul
5 Lazić, Ranko
5 Maneth, Sebastian
4 Bollig, Benedikt
4 Fisman, Dana
4 Héam, Pierre-Cyrille
4 Lohrey, Markus
4 Place, Thomas
4 Schmitz, Sylvain
4 Schwentick, Thomas
4 Tan, Tony
4 Zeitoun, Marc
4 Zimmermann, Martín G.
3 Abriola, Sergio
3 Alur, Rajeev
3 Björklund, Henrik
3 Blumensath, Achim
3 Chen, Liang-Ting
3 Figueira, Diego
3 Figueira, Santiago
3 Gabbay, Murdoch James
3 Hugot, Vincent
3 Idziaszek, Tomasz
3 Keshvardoost, Khadijeh
3 Klin, Bartek
3 Kozen, Dexter C.
3 Libkin, Leonid O.
3 Mamouras, Konstantinos
3 Martens, Wim
3 Michalewski, Henryk
3 Milius, Stefan
3 Montanari, Angelo
3 Murlak, Filip
3 Reynier, Pierre-Alain
3 Sala, Pietro
3 Segoufin, Luc
3 Silva, Alexandra
3 Talbot, Jean-Marc
3 Urbat, Henning
2 Adámek, Jiří
2 Alirezazadeh, Saeid
2 Babari, Parvaneh
2 Bárány, Vince
2 Björklund, Johanna
2 Carapelle, Claudia
2 Cavallari, Filippo
2 Charatonik, Witold
2 Choffrut, Christian
2 David, Claire
2 Decker, Normann
2 Descotte, María Emilia
2 Deters, Morgan
2 Diekert, Volker
2 Droste, Manfred
2 Fervari, Raul
2 Filiot, Emmanuel
2 Grigorieff, Serge
2 Habermehl, Peter
2 Hofman, Piotr
2 Kartzow, Alexander
2 Kouchnarenko, Olga
2 Kufleitner, Manfred
2 Kupferman, Orna
2 Mahmoudi, Mojgan
2 Masopust, Tomáš
2 Mio, Matteo
2 Monmege, Benjamin
2 Murawski, Andrzej S.
2 Muscholl, Anca
2 Neven, Frank
2 Nicaud, Cyril
2 Niehren, Joachim
2 Paredaens, Jan
2 Parys, Paweł
2 Pazzaglia, Marco
2 Perevoshchikov, Vitaly
2 Petrisan, Daniela Luan
2 Piterman, Nir
2 Pous, Damien
2 Raghothaman, Mukund
2 ten Cate, Balder David
2 Thoma, Daniel
2 Thomas, Wolfgang
2 Tzevelekos, Nikos
2 Weil, Pascal
2 Wu, Zhilin
1 Abdulla, Parosh Aziz
1 Abramsky, Samson
1 Aiswarya, Cyriac
1 Alibabaei, Khadijeh
1 Amano, Shun’ichi
1 Amarilli, Antoine
1 Angluin, Dana
1 Antonopoulos, Timos
...and 186 more Authors

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.