default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyoma Sin'ya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Takao Yuyama, Ryoma Sin'ya:
Measuring Power of Commutative Group Languages. CIAA 2024: 347-362- 2023
- [c12]Ryoma Sin'ya:
Measuring Power of Generalised Definite Languages. CIAA 2023: 278-289 - [c11]Yoshiki Nakamura
, Ryoma Sin'ya:
Words-to-Letters Valuations for Language Kleene Algebras with Variable Complements. AFL 2023: 185-199 - 2022
- [c10]Ryoma Sin'ya:
Measuring Power of Locally Testable Languages. DLT 2022: 274-285 - 2021
- [c9]Ryoma Sin'ya:
Carathéodory Extensions of Subclasses of Regular Languages. DLT 2021: 355-367 - [c8]Ryoma Sin'ya:
Asymptotic Approximation by Regular Languages. SOFSEM 2021: 74-88 - 2020
- [c7]Ryoma Sin'ya:
Context-Freeness of Word-MIX Languages. DLT 2020: 304-318 - [c6]Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada:
On Average-Case Hardness of Higher-Order Model Checking. FSCD 2020: 21:1-21:23 - [i8]Ryoma Sin'ya:
Asymptotic Approximation by Regular Languages. CoRR abs/2008.01413 (2020)
2010 – 2019
- 2019
- [j1]Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada:
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence. Log. Methods Comput. Sci. 15(1) (2019) - [c5]Soh Kumabe, Takanori Maehara, Ryoma Sin'ya:
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. WALCOM 2019: 248-260 - [i7]Ryoma Sin'ya:
Simple proof of Parikh's theorem a la Takahashi. CoRR abs/1909.09393 (2019) - 2018
- [i6]Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada:
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence. CoRR abs/1801.03886 (2018) - [i5]Soh Kumabe, Takanori Maehara, Ryoma Sin'ya:
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem. CoRR abs/1807.04942 (2018) - [i4]Ryoma Sin'ya:
Note on the Infiniteness of L(w1, ..., wk). CoRR abs/1812.02600 (2018) - 2017
- [c4]Ryoma Sin'ya, Kazuyuki Asada, Naoki Kobayashi, Takeshi Tsukada:
Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence. FoSSaCS 2017: 53-68 - 2015
- [c3]Ryoma Sin'ya:
An Automata Theoretic Approach to the Zero-One Law for Regular Languages: Algorithmic and Logical Aspects. GandALF 2015: 172-185 - 2014
- [c2]Ryoma Sin'ya:
Graph Spectral Properties of Deterministic Finite Automata - (Short Paper). Developments in Language Theory 2014: 76-83 - [i3]Ryoma Sin'ya, Kiminori Matsuzaki, Masataka Sassa:
Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching. CoRR abs/1405.0562 (2014) - [i2]Ryoma Sin'ya:
Graph Spectral Properties of Deterministic Finite Automata. CoRR abs/1405.2553 (2014) - 2013
- [c1]Ryoma Sin'ya, Kiminori Matsuzaki, Masataka Sassa:
Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching. ICPP 2013: 220-229 - [i1]Ryoma Sin'ya:
Text Compression using Abstract Numeration System on a Regular Language. CoRR abs/1308.0267 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
