Mikołaj Bojańczyk

Mikołaj Bojańczyk (born 1977) is a Polish theoretical computer scientist and logician known for settling open problems on tree walking automata jointly with Thomas Colcombet, and for contributions to logic in automata theory. He is a professor at Warsaw University. Provided by Wikipedia
Showing 1 - 12 results of 12 for search 'Mikołaj Bojańczyk', query time: 0.03s Refine Results
  1. 1
    Two-Way Unary Temporal Logic over Trees

    Two-Way Unary Temporal Logic over Trees by Mikolaj Bojanczyk

    Published 2009-08-01
    Get full text
    Article
  2. 2
    A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra

    A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra by Mikołaj Bojańczyk, Bartek Klin

    Published 2019-11-01
    Get full text
    Article
  3. 3
    An extension of data automata that captures XPath

    An extension of data automata that captures XPath by Mikołaj Bojańczyk, Sławomir Lasota

    Published 2012-02-01
    Get full text
    Article
  4. 4
    Optimizing tree decompositions in MSO

    Optimizing tree decompositions in MSO by Mikołaj Bojańczyk, Michał Pilipczuk

    Published 2022-02-01
    Get full text
    Article
  5. 5
    Tree Languages Defined in First-Order Logic with One Quantifier Alternation

    Tree Languages Defined in First-Order Logic with One Quantifier Alternation by Mikolaj Bojanczyk, Luc Segoufin

    Published 2010-10-01
    Get full text
    Article
  6. 6
    Boundedness in languages of infinite words

    Boundedness in languages of infinite words by Mikołaj Bojańczyk, Thomas Colcombet

    Published 2017-10-01
    Get full text
    Article
  7. 7
    Definable decompositions for graphs of bounded linear cliquewidth

    Definable decompositions for graphs of bounded linear cliquewidth by Mikołaj Bojańczyk, Martin Grohe, Michał Pilipczuk

    Published 2021-01-01
    Get full text
    Article
  8. 8
    Wreath Products of Forest Algebras, with Applications to Tree Logics

    Wreath Products of Forest Algebras, with Applications to Tree Logics by Mikolaj Bojanczyk, Igor Walukiewicz, Howard Straubing

    Published 2012-09-01
    Get full text
    Article
  9. 9
    Piecewise testable tree languages

    Piecewise testable tree languages by Mikołaj Bojańczyk, Luc Segoufin, Howard Straubing

    Published 2012-09-01
    Get full text
    Article
  10. 10
    Automata theory in nominal sets

    Automata theory in nominal sets by Mikołaj Bojańczyk, Bartek Klin, Sławomir Lasota

    Published 2014-08-01
    Get full text
    Article
  11. 11
    Regular tree languages in low levels of the Wadge Hierarchy

    Regular tree languages in low levels of the Wadge Hierarchy by Mikołaj Bojańczyk, Filippo Cavallari, Thomas Place, Michał Skrzypczak

    Published 2019-09-01
    Get full text
    Article
  12. 12
    Undecidability of a weak version of MSO+U

    Undecidability of a weak version of MSO+U by Mikołaj Bojańczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith

    Published 2020-02-01
    Get full text
    Article

Search Tools: