activity
20132025
most citedAn Automata Theoretic Approach to the Zero-One Law for Regular Languages: Algorithmic and Logical Aspects

10 citations · 22 across the 13 of their papers we have counts for

collaborators

13 papers

cs.FL2025

Measure-Theoretic Aspects of Star-Free and Group Languages

Ryoma Sin'ya, Takao Yuyama

A language is said to be -measurable, where is a class of languages, if there is an infinite sequence of languages in that ``converges'' to .…

cs.LO2024

Words-to-Letters Valuations for Language Kleene Algebras with Variable and Constant Complements

Yoshiki Nakamura, Ryoma Sin'ya

We investigate the equational theory for Kleene algebra terms with variable complements and constant complements -- (language) complement where it applies only to variables or cons…

cs.LO2023

Words-to-Letters Valuations for Language Kleene Algebras with Variable Complements

Yoshiki Nakamura, Ryoma Sin'ya

We investigate the equational theory of Kleene algebra terms with variable complements -- (language) complement where it applies only to variables -- w.r.t. languages. While the eq…

cs.FL2020★ 1 cited

Asymptotic Approximation by Regular Languages

Ryoma Sin'ya

This paper investigates a new property of formal languages called REG-measurability where REG is the class of regular languages. Intuitively, a language \(L\) is REG-measurable if…

cs.FL2019★ 1 cited

Simple proof of Parikh's theorem a la Takahashi

Ryoma Sin'ya

In this report we describe a simple proof of Parikh's theorem a la Takahashi, based on a decomposition of derivation trees. The idea of decomposition is appeared in her master's th…

cs.FL2018

Note on the Infiniteness and Equivalence Problems for Word-MIX Languages

Ryoma Sin'ya

In this note we provide a (decidable) graph-structural characterisation of the infiniteness of , where $L(w_1, ..., w_k) = \{w \in A^* | |w|_{w_1} = \cdots = |w|_…