SIN'YA Ryoma

写真a

Affiliation

Graduate School of Engineering Science  Department of Mathematical Science and Electrical-Electronic-Computer Engineering  Mathematical Science Course 

Date of Birth

1988

Mail Address

E-mail address

To the head of this page.▲

Research Interests 【 display / non-display 】

  • Formal Language Theory

  • Automata Theory

To the head of this page.▲

Graduating School 【 display / non-display 】

  • 2007.04
    -
    2011.03

    University of the Ryukyus     The Department of Information Engineering   Graduated

To the head of this page.▲

Graduate School 【 display / non-display 】

  • 2011.04
    -
    2016.03

    Tokyo Institute of Technology    Department of Mathematical and Computing Sciences  Doctor's Course  Completed

To the head of this page.▲

Studying abroad experiences 【 display / non-display 】

  • 2015.10
    -
    2016.10

    Télécom ParisTech   Visiting Ph.D. student

To the head of this page.▲

Degree 【 display / non-display 】

  • Tokyo Institute of Technology -  Doctor (Science)

To the head of this page.▲

Campus Career 【 display / non-display 】

  • 2021.04
    -
    Now

    Akita University   Graduate School of Engineering Science   Department of Mathematical Science and Electrical-Electronic-Computer Engineering   Mathematical Science Course   Assistant Professor  

  • 2017.11
    -
    2021.03

    Akita University   Graduate School of Engineering Science   Department of Mathematical Science and Electrical-Electronic-Computer Engineering   Mathematical Science Course   Specially-appointed Assistant Professor  

To the head of this page.▲

External Career 【 display / non-display 】

  • 2016.04
    -
    2017.10

    The University of Tokyo   Graduate School of Information Science and Technology   Researcher  

To the head of this page.▲

Research Areas 【 display / non-display 】

  • Informatics / Theory of informatics

  • Natural Science / Basic mathematics

To the head of this page.▲
 

Thesis for a degree 【 display / non-display 】

To the head of this page.▲

Research Achievements 【 display / non-display 】

    ◆Original paper【 display / non-display 】

  • Asymptotic Approximation by Regular Languages

    Ryoma Sin'ya

    The proceedings of the 47th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'21) ( Springer, Cham )  12607   74 - 88   2021.01  [Refereed]

    Research paper (journal)   Single author

    DOI

  • Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence

    Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada

    Logical Methods in Computer Science   15 ( 1 )   2019.02  [Refereed]  [Invited]

    Research paper (journal)   Domestic Co-author

    It is well known that the length of a beta-reduction sequence of a simply typed lambda-term of order k can be huge; it is as large as k-fold exponential in the size of the lambda-term in the worst case. We consider the following relevant question about quantitative properties, instead of the worst case: how many simply typed lambda-terms have very long reduction sequences? We provide a partial answer to this question, by showing that asymptotically almost every simply typed lambda-term of order k has a reduction sequence as long as (k-1)-fold exponential in the term size, under the assumption that the arity of functions and the number of variables that may occur in every subterm are bounded above by a constant. To prove it, we have extended the infinite monkey theorem for strings to a parametrized one for regular tree languages, which may be of independent interest. The work has been motivated by quantitative analysis of the complexity of higher-order model checking.

  • Automata Theory Revised

    Ryoma Sin'ya

    Computer Software   34 ( 3 ) 3 - 35   2017.09  [Refereed]  [Invited]

    Research paper (journal)   Single author

    DOI

  • A New Technique for Proving Non-Regularity based on the Measure of a Language

    Ryoma Sin'ya

    Computer Software   34 ( 1 ) 163 - 179   2017.02  [Refereed]  [Invited]

    Research paper (journal)   Single author

    DOI

    • To the head of this page.▲

    ◆International conference proceedings【 display / non-display 】

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

    Yoshiki Nakamura, Ryoma Sin'ya

    Proceedings of the 16th International Conference on Automata and Formal Languages ( Electronic Proceedings in Theoretical Computer Science )    2023.09  [Refereed]

    Research paper (international conference proceedings)   Domestic Co-author

  • Measuring Power of Generalised Definite Languages

    Ryoma Sin'ya

    In Proceedings of the 27th International Conference on Implementation and Application of Automata ( Springer )    2023.08  [Refereed]

    Research paper (international conference proceedings)   Single author

    DOI

  • Measuring Power of Locally Testable Languages

    Ryoma Sin'ya

    Proceedings of the 26th International Conference on Developments in Language Theory ( Springer )    2022.05  [Refereed]

    Research paper (international conference proceedings)   Single author

  • Carathéodory Extensions of Subclasses of Regular Languages

    Ryoma Sin'ya

    The proceedings of the 25th International Conference on Developments in Language Theory (DLT2021) ( Springer International Publishing )    2021.08  [Refereed]

    Research paper (international conference proceedings)   Single author

  • On average-case hardness of higher-order model checking

    Nakamura Y.

    Leibniz International Proceedings in Informatics, LIPIcs ( Leibniz International Proceedings in Informatics, LIPIcs )  167   2020.06  [Refereed]

    Research paper (international conference proceedings)   Domestic Co-author

    DOI

    • display all >>

    To the head of this page.▲

    ◆Other【 display / non-display 】

  • Regular languages that can be approximated by testing subword occurrences

    SIN'YA Ryoma, YAMAGUCHI Yutaro, NAKAMURA Yoshiki

    Computer Software ( Japan Society for Software Science and Technology )  40 ( 2 ) 49 - 60   2023.05

    Domestic Co-author

    <p>A language <I>L</I> is said to be regular-measurable if there exists an infinite sequence of pairs of regular languages that “converges" to <I>L</I>. Instead of regular languages, this paper examines measuring power of several fragments of regular languages: piecewise testable (PT) and alphabet testable (AT) languages. In particular, we showed that, while AT-measurability for regular languages is co-<B>NP</B> complete, PT-measurability is decidable in linear time.</p>

    DOI CiNii Research

  • Formal Language Theory: Between Commutativity and Non-Commutativity

    Sin'ya Ryoma

    Bulletin of the Japan Society for Industrial and Applied Mathematics ( The Japan Society for Industrial and Applied Mathematics )  31 ( 4 ) 15 - 22   2021.12

    DOI CiNii Research

To the head of this page.▲

Academic Awards Received 【 display / non-display 】

  • Yamauchi Award, the 57th Programming Symposium, IPSJ

    2017.01    

    Winner： Ryoma Sin'ya

To the head of this page.▲

Grant-in-Aid for Scientific Research 【 display / non-display 】

  • Grant-in-Aid for Early-Career Scientists

    Project Year： 2019.04  -  2023.03 

To the head of this page.▲

Presentations 【 display / non-display 】

  • Context-Freeness of Word-MIX Languages

    Ryoma Sin'ya

    Developments in Language Theory 2021  2021.08  -  2021.08 

  • Caratheodory Extensions of Subclasses of Regular Languages

    Ryoma Sin'ya

    Developments in Language Theory 2021  2021.08  -  2021.08 

  • Asymptotic Approximation by Regular Languages

    Ryoma Sin'ya

    Logic, Language, Algebraic system and Related Areas in Computer Science  (オンライン開催(zoom))  2020.02  -  2020.02 

To the head of this page.▲
 

Academic Activity 【 display / non-display 】

  • 2020.12
    -
    Now

    Steering Committee

  • 2018.04
    -
    Now

  • 2018.04
    -
    Now

To the head of this page.▲