◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Niwinski

2 papers hereh-index 211.6k citations58 works total

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

author position
  • first author1
  • last author1

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

fields
  • cs.FL1
  • math.LO1

identity via Semantic Scholar / OpenAlex

most citedComputing measures of weak-MSO definable sets of trees

2 citations · 3 across the 2 of their papers we have counts for

collaborators

2 papers

cs.FL2024★ 2 cited

Computing measures of weak-MSO definable sets of trees

Damian Niwiński, Marcin Przybyłko, Michał Skrzypczak

This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recogni…

math.LO2009★ 1 cited

On the Borel Inseparability of Game Tree Languages

Szczepan Hummel, Henryk Michalewski, Damian Niwinski

The game tree languages can be viewed as an automata-theoretic counterpart of parity games on graphs. They witness the strictness of the index hierarchy of alternating tree automat…

◍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.