| ||
| 1. | Algorithms for regular languages that use algebra
SIAM JOURNAL ON COMPUTING Tom 41 Nr 2 r. 2012, str. 5-14 (Artyku³) Miko³aj Bojañczyk | |
| 2. | An extension of data automata that captures XPath
LOGICAL METHODS IN COMPUTER SCIENCE Tom 8 Nr 1 r. 2012, str. (Artyku³) Miko³aj Bojañczyk, S³awomir Lasota | |
| 3. | Finite satisfiability for guarded fixpoint logic
INFORMATION PROCESSING LETTERS Tom 112 Nr 10 r. 2012, str. 371-375 (Artyku³) Vince Bárány, Miko³aj Bojañczyk | |
| 4. | Piecewise testable tree languages
LOGICAL METHODS IN COMPUTER SCIENCE Tom 8 Nr 3 r. 2012, str. (Artyku³) Miko³aj Bojañczyk, Luc Segoufin, Howard Straubing | |
| 5. | Wreath Products of Forest Algebras, with Applications to Tree Logics
LOGICAL METHODS IN COMPUTER SCIENCE Tom 8 Nr 3 r. 2012, str. 1-39 (Artyku³) Miko³aj Bojañczyk, Howard Straubing, Igor Walukiewicz | |
| 6. | Foreword
THEORY OF COMPUTING SYSTEMS Tom 49 Nr 2 r. 2011, str. 365-366 (Artyku³) Albert Atserias, Miko³aj Bojañczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, Kenneth Ross | |
| 7. | Two-variable logic on data words
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC Tom 12 Nr 4 r. 2011, str. (Artyku³) Miko³aj Bojañczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin | |
| 8. | Weak MSO with the Unbounding Quantifier
THEORY OF COMPUTING SYSTEMS Tom 48 Nr 3 r. 2011, str. 554-576 (Artyku³) Miko³aj Bojañczyk | |
| 9. | XPath evaluation in linear time
JOURNAL OF THE ACM Tom 58 Nr 4 r. 2011, str. 17-17 (Artyku³) Pawe³ Parys, Miko³aj Bojañczyk | |
| 10. | Efficient Evaluation of Nondeterministic Automata Using Factorization Forests
LECTURE NOTES IN COMPUTER SCIENCE Tom 6198 r. 2010, str. 515-526 (Artyku³) Miko³aj Bojañczyk, Pawe³ Parys | |
| 11. | On the Borel Complexity of MSO Definable Sets of Branches
FUNDAMENTA INFORMATICAE Tom 98 Nr 4 r. 2010, str. 337-349 (Artyku³) Miko³aj Bojañczyk, Damian Niwiñski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Micha³ Skrzypczak | |
| 12. | Tree Languages Defined in First-Order Logic with One Quantifier Alternation
LOGICAL METHODS IN COMPUTER SCIENCE Tom 6 Nr 4 r. 2010, str. 1-26 (Artyku³) Miko³aj Bojañczyk, Luc Segoufin | |
| 13. | Algebra for Infinite Forests with an Application to the Temporal Logic EF
LECTURE NOTES IN COMPUTER SCIENCE Tom 5710 r. 2009, str. 131-145 (Artyku³) Miko³aj Bojañczyk, Tomasz Idziaszek | |
| 14. | Algebra for Tree Languages
LECTURE NOTES IN COMPUTER SCIENCE Tom 5771 r. 2009, str. 1-1 (Artyku³ konferencyjny) Miko³aj Bojañczyk | |
| 15. | Factorization Forests
LECTURE NOTES IN COMPUTER SCIENCE Tom 5583 r. 2009, str. 1-17 (Artyku³ konferencyjny) Miko³aj Bojañczyk | |
| 16. | Two-variable logic on data trees and XML reasoning
JOURNAL OF THE ACM Tom 56 Nr 3 r. 2009, str. (Artyku³) Miko³aj Bojañczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin | |
| 17. | Two-Way Unary Temporal Logic over Trees
[ LINK ]
LOGICAL METHODS IN COMPUTER SCIENCE Tom 5 Nr 3 r. 2009, str. 1-29 (Artyku³) Miko³aj Bojañczyk | |
| 18. | The Common Fragment of ACTL and LTL
LECTURE NOTES IN COMPUTER SCIENCE Tom 4962 r. 2008, str. 172-185 (Artyku³) Miko³aj Bojañczyk | |
| 19. | Tree Languages Defined in First-Order Logic with One Quantifier Alternation
LECTURE NOTES IN COMPUTER SCIENCE Tom 5126 r. 2008, str. 233-245 (Artyku³) Miko³aj Bojañczyk, Luc Segoufin | |
| 20. | Tree-Walking Automata
LECTURE NOTES IN COMPUTER SCIENCE Tom 5196 r. 2008, str. 1-2 (Artyku³) Miko³aj Bojañczyk | |
| 21. | Tree-Walking Automata Do Not Recognize All Regular Languages
SIAM JOURNAL ON COMPUTING Tom 38 Nr 2 r. 2008, str. 658-701 (Artyku³) Miko³aj Bojañczyk, Thomas Colcombet | |
| 22. | A new algorithm for testing if a regular language is locally threshold testable
INFORMATION PROCESSING LETTERS Tom 104 Nr 3 r. 2007, str. 91-94 (Artyku³) Miko³aj Bojañczyk | |
| 23. | Bounded Depth Data Trees
LECTURE NOTES IN COMPUTER SCIENCE Tom 4596 r. 2007, str. 862-874 (Artyku³ konferencyjny) Henrik Bjorklund, Miko³aj Bojañczyk | |
| 24. | Forest Expressions
LECTURE NOTES IN COMPUTER SCIENCE Tom 4646 r. 2007, str. 146-160 (Artyku³ konferencyjny) Miko³aj Bojañczyk | |
| 25. | Reachability in Unions of Commutative Rewriting Systems Is Decidable
LECTURE NOTES IN COMPUTER SCIENCE Tom 4393 r. 2007, str. 622-633 (Artyku³ konferencyjny) Piotr Hoffman, Miko³aj Bojañczyk | |