Bojańczyk, Mikołaj

1. Definability equals recognizability for graphs of bounded treewidth
   2016/05/10 by Mikołaj Bojańczyk, Michał Pilipczuk, Bojańczyk, Mikołaj +1 · 5 citations
   Computer Science · #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO) #cs.CC #cs.DM #cs.DS #cs.FL #cs.LO
2. String-to-String Interpretations with Polynomial-Size Output
   2019/05/30 by Bojańczyk, Mikołaj, Kiefer, Sandra, Lhote, Nathan · 3 citations
   #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)
3. Polyregular Functions
   2018/10/20 by Bojańczyk, Mikołaj · 2 citations
   #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)
4. 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
   2020/08/26 by Mikołaj Bojańczyk, Bojańczyk, Mikołaj · 1 citation
   Computer Science · #Advanced Algebra and Logic #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic, Reasoning, and Knowledge #semigroups and automata theory
5. The category of MSO transductions
   2023/05/29 by Mikołaj Bojańczyk, Bojańczyk, Mikołaj · 1 citation
   Computer Science · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Natural Language Processing Techniques #semigroups and automata theory