| 2009 |
|---|
| 29 | EE | Mikolaj Bojanczyk:
Weak MSO with the Unbounding Quantifier.
STACS 2009: 159-170 |
| 28 | EE | Mikolaj Bojanczyk:
Weak Mso with the Unbounding Quantifier
CoRR abs/0902.1042: (2009) |
| 27 | EE | Mikolaj Bojanczyk:
Two-Way Unary Temporal Logic over Trees
CoRR abs/0904.4119: (2009) |
| 2008 |
|---|
| 26 | EE | Mikolaj Bojanczyk:
The Common Fragment of ACTL and LTL.
FoSSaCS 2008: 172-185 |
| 25 | EE | Mikolaj Bojanczyk,
Luc Segoufin:
Tree Languages Defined in First-Order Logic with One Quantifier Alternation.
ICALP (2) 2008: 233-245 |
| 24 | EE | Mikolaj Bojanczyk:
Tree-Walking Automata.
LATA 2008: 1-2 |
| 23 | EE | Mikolaj Bojanczyk,
Luc Segoufin,
Howard Straubing:
Piecewise Testable Tree Languages.
LICS 2008: 442-451 |
| 22 | EE | Mikolaj Bojanczyk,
Pawel Parys:
XPath evaluation in linear time.
PODS 2008: 241-250 |
| 21 | EE | Mikolaj Bojanczyk,
Thomas Colcombet:
Tree-Walking Automata Do Not Recognize All Regular Languages.
SIAM J. Comput. 38(2): 658-701 (2008) |
| 2007 |
|---|
| 20 | EE | Mikolaj Bojanczyk:
Forest Expressions.
CSL 2007: 146-160 |
| 19 | EE | Henrik Björklund,
Mikolaj Bojanczyk:
Bounded Depth Data Trees.
ICALP 2007: 862-874 |
| 18 | EE | Mikolaj Bojanczyk:
Two-way unary temporal logic over trees.
LICS 2007: 121-130 |
| 17 | EE | Henrik Björklund,
Mikolaj Bojanczyk:
Shuffle Expressions and Words with Nested Data.
MFCS 2007: 750-761 |
| 16 | EE | Mikolaj Bojanczyk,
Piotr Hoffman:
Reachability in Unions of Commutative Rewriting Systems Is Decidable.
STACS 2007: 622-633 |
| 15 | EE | Mikolaj Bojanczyk:
A new algorithm for testing if a regular language is locally threshold testable.
Inf. Process. Lett. 104(3): 91-94 (2007) |
| 2006 |
|---|
| 14 | EE | Mikolaj Bojanczyk,
Mathias Samuelides,
Thomas Schwentick,
Luc Segoufin:
Expressive Power of Pebble Automata.
ICALP (1) 2006: 157-168 |
| 13 | EE | Mikolaj Bojanczyk,
Thomas Colcombet:
Bounds in w-Regularity.
LICS 2006: 285-296 |
| 12 | EE | Mikolaj Bojanczyk,
Anca Muscholl,
Thomas Schwentick,
Luc Segoufin,
Claire David:
Two-Variable Logic on Words with Data.
LICS 2006: 7-16 |
| 11 | EE | Mikolaj Bojanczyk,
Claire David,
Anca Muscholl,
Thomas Schwentick,
Luc Segoufin:
Two-variable logic on data trees and XML reasoning.
PODS 2006: 10-19 |
| 10 | EE | Mikolaj Bojanczyk,
Thomas Colcombet:
Tree-walking automata cannot be determinized.
Theor. Comput. Sci. 350(2-3): 164-173 (2006) |
| 9 | EE | Mikolaj Bojanczyk,
Igor Walukiewicz:
Characterizing EF and EX tree logics.
Theor. Comput. Sci. 358(2-3): 255-272 (2006) |
| 2005 |
|---|
| 8 | EE | Mikolaj Bojanczyk,
Thomas Colcombet:
Tree-walking automata do not recognize all regular languages.
STOC 2005: 234-243 |
| 2004 |
|---|
| 7 | EE | Mikolaj Bojanczyk,
Igor Walukiewicz:
Characterizing EF and EX Tree Logics.
CONCUR 2004: 131-145 |
| 6 | EE | Mikolaj Bojanczyk:
A Bounding Quantifier.
CSL 2004: 41-55 |
| 5 | EE | Mikolaj Bojanczyk,
Thomas Colcombet:
Tree-Walking Automata Cannot Be Determinized.
ICALP 2004: 246-256 |
| 2003 |
|---|
| 4 | EE | Mikolaj Bojanczyk:
1-Bounded TWA Cannot Be Determinized.
FSTTCS 2003: 62-73 |
| 3 | EE | Mikolaj Bojanczyk:
The finite graph problem for two-way alternating automata.
Theor. Comput. Sci. 3(298): 511-528 (2003) |
| 2002 |
|---|
| 2 | EE | Mikolaj Bojanczyk:
Two-Way Alternating Automata and Finite Models.
ICALP 2002: 833-844 |
| 2001 |
|---|
| 1 | EE | Mikolaj Bojanczyk:
The Finite Graph Problem for Two-Way Alternating Automata.
FoSSaCS 2001: 88-103 |
