Ryoma Sin'ya - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2023

Measuring Power of Generalised Definite LanguagesRyoma Sin'ya. wia 2023: 278-289 [doi]

2022

Measuring Power of Locally Testable LanguagesRyoma Sin'ya. dlt 2022: 274-285 [doi]

2021

Asymptotic Approximation by Regular LanguagesRyoma Sin'ya. sofsem 2021: 74-88 [doi]

Carathéodory Extensions of Subclasses of Regular LanguagesRyoma Sin'ya. dlt 2021: 355-367 [doi]

2020

On Average-Case Hardness of Higher-Order Model CheckingYoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi 0001, Ryoma Sin'ya, Takeshi Tsukada. fscd 2020: [doi]

Context-Freeness of Word-MIX LanguagesRyoma Sin'ya. dlt 2020: 304-318 [doi]

2019

Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction SequenceKazuyuki Asada, Naoki Kobayashi 0001, Ryoma Sin'ya, Takeshi Tsukada. lmcs, 15(1), 2019. [doi]

Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack ProblemSoh Kumabe, Takanori Maehara, Ryoma Sin'ya. walcom 2019: 248-260 [doi]

2017

Almost Every Simply Typed λ-Term Has a Long β-Reduction SequenceRyoma Sin'ya, Kazuyuki Asada, Naoki Kobayashi 0001, Takeshi Tsukada. fossacs 2017: 53-68 [doi]

2014

Graph Spectral Properties of Deterministic Finite Automata - (Short Paper)Ryoma Sin'ya. dlt 2014: 76-83 [doi]

2013

Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression MatchingRyoma Sin'ya, Kiminori Matsuzaki, Masataka Sassa. icpp 2013: 220-229 [doi]

Sign in or sign up to see more results.

runs on WebDSL