◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Yoshiki Nakamura

2 papers hereh-index 10389 citations148 works total

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

author position
  • sole author2

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

fields
  • cs.FL1
  • cs.LO1
same name
  • Yoshiki Nakamura — 5 papers, h 2
  • Yoshiki Nakamura — 3 papers, h 2
  • Yoshiki Nakamura — 3 papers, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

most citedThe Undecidability of FO3 and the Calculus of Relations with Just One Binary Relation

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

collaborators
Showing cs.FLShow all

1 paper · 1 filter

cs.FL2016★ 1 cited

The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities

Yoshiki Nakamura

We introduce p-equivalence by asymptotic probabilities, which is a weak almost-equivalence based on zero-one laws in finite model theory. In this paper, we consider the computation…

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