The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities. - Yoshiki Nakamura 001 (GandALF, 2016)

Partial derivatives on graphs for Kleene allegories. - Yoshiki Nakamura 001 (LICS, 2017)

The Undecidability of FO3 and the Calculus of Relations with Just One Binary Relation. - Yoshiki Nakamura 001 (ICLA, 2019)

Expressive Power and Succinctness of the Positive Calculus of Relations. - Yoshiki Nakamura 001 (RAMiCS, 2020)

On Average-Case Hardness of Higher-Order Model Checking. - Yoshiki Nakamura 001; Kazuyuki Asada; Naoki Kobayashi 001; Ryoma Sin'ya; Takeshi Tsukada (FSCD, 2020)

On Implicational Intermediate Logics Axiomatizable by Formulas Minimal in Classical Logic: A Counter-Example to the Komori-Kashima Problem. - Yoshiki Nakamura 001; Naosuke Matsuda (Stud Logica, 2021)

Spatial Existential Positive Logics for Hyperedge Replacement Grammars. - Yoshiki Nakamura 001 (CSL, 2022)

Expressive power and succinctness of the positive calculus of binary relations. - Yoshiki Nakamura 001 (J. Log. Algebraic Methods Program., 2022)

Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations. - Yoshiki Nakamura 001 (LICS, 2023)

On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation. - Yoshiki Nakamura 001 (MFCS, 2023)

Words-to-Letters Valuations for Language Kleene Algebras with Variable Complements. - Yoshiki Nakamura 001; Ryoma Sin'ya (AFL, 2023)

Note on a Translation from First-Order Logic into the Calculus of Relations Preserving Validity and Finite Validity. - Yoshiki Nakamura 001 (CoRR, 2023)

Undecidability of the Positive Calculus of Relations with Transitive Closure and Difference: Hypothesis Elimination Using Graph Loops. - Yoshiki Nakamura 001 (RAMiCS, 2024)

Derivatives on Graphs for the Positive Calculus of Relations with Transitive Closure. - Yoshiki Nakamura 001 (CoRR, 2024)

Words-to-Letters Valuations for Language Kleene Algebras with Variable and Constant Complements. - Yoshiki Nakamura 001; Ryoma Sin'ya (CoRR, 2024)

Finite Relational Semantics for Language Kleene Algebra with Complement. - Yoshiki Nakamura 001 (CSL, 2025)

Guarded Negation Transitive Closure Logic is 2-EXPTIME-complete. - Yoshiki Nakamura 001 (CoRR, 2025)

Undecidability of the Emptiness Problem of Deterministic Propositional While Programs with Graph Loop: Hypothesis Elimination Using Loops. - Yoshiki Nakamura 001 (CoRR, 2025)