◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Mikolaj Boja'nczyk

3 papers hereh-index 11 citations3 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author1

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • cs.FL1
  • cs.LO1
  • cs.PL1

identity via Semantic Scholar / OpenAlex

works on
automata theory 1communication complexity 1functions over arbitrary domains 1nerode theorem 1nominal sets 1regular languages 1

From the 1 of 3 linked papers with an AI index.

collaborators

3 papers

cs.FL2026

Regularity as seen by Alice and Bob

Omid Yaghoubi, Mikołaj Bojańczyk, Aliaume Lopez +1

The paper proposes a unified model that extends Nerode-style characterizations of regularity to functions with arbitrary output domains, using a constant‑communication protocol bet…

cs.PL2026

Polyregular equivalence is undecidable in higher-order types

Mikołaj Bojańczyk, Grzegorz Fabiański, Rafał Stefański

It is open whether equivalence ( f = g ) is decidable for string-to-string polyregular functions. We consider their higher-order extension based on the λ-calculus definition of po…

cs.LO2025

Low rank MSO

Mikołaj Bojańczyk, Michał Pilipczuk, Wojciech Przybyszewski +2

We introduce a new logic for describing properties of graphs, which we call low rank MSO. This is the fragment of monadic second-order logic in which set quantification is restrict…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.