Ryoma Sin'ya
新屋 良磨

Manuscript:

• Ryoma Sin'ya
  Simple proof of Parikh’s theorem a la Takahashi
  arXiv

Conference Paper (selected):

• Takao Yuyama, Ryoma Sin'ya
  Measuring Power of Commutative Group Languages
  In Proceedings of the 28th International Conference on Implementation and Application of Automata (CIAA 2024).
  publisher's version [full version]


• Ryoma Sin'ya
  Measuring Power of Generalised Definite Languages
  In Proceedings of the 27th International Conference on Implementation and Application of Automata (CIAA 2023).
  publisher's version [author's version] [slides]


• Ryoma Sin'ya
  Measuring Power of Locally Testable Languages
  In Proceedings of the 26th International Conference on Developments in Language Theory (DLT 2022).
  publisher's version [full version] [slides]


• Ryoma Sin'ya
  Carathéodory Extensions of Subclasses of Regular Languages
  In Proceedings of the 25th International Conference on Developments in Language Theory (DLT 2021).
  publisher's version [full version] [Japanese draft version] [slides]


• Ryoma Sin'ya
  Asymptotic Approximation by Regular Languages
  In Proceedings of the 47th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2021).
  publisher's version [full version] [arXiv]


• Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya and Takeshi Tsukada
  On Average-Case Hardness of Higher-Order Model Checking
  In Proceedings of 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020),
  publisher's version


• Ryoma Sin'ya
  Context-Freeness of Word-MIX Languages
  In Proceedings of 24th International Conference on Developments in Language Theory (DLT 2020),
  publisher's version [full version] [slides]


• Ryoma Sin'ya, Kazuyuki Asada, Naoki Kobayashi, and Takeshi Tsukada
  Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence
  In Proceedings of 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017),
  publisher's version [full version] [slides]


• Ryoma Sin'ya
  An Automata Theoretic Approach to the Zero-One Law for Regular Languages: Algorithmic and Logical Aspects
  In Proceedings of 6th International Symposium on Games, Automata, Logics and Formal Verification (GandALF2015),
  publisher's version


• Ryoma Sin'ya
  Graph Spectral Properties of Deterministic Finite Automata
  In Proceedings of 18th International Conference on Developments in Language Theory (DLT 2014),
  publisher's version [full version]


• Ryoma Sin'ya, Kiminori Matsuzaki, Masataka Sassa
  Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching
  In Proceedings of 42nd International Conference on Parallel Processing (ICPP 2013),
  publisher's version

Journal:

• Ryoma Sin'ya, Yutaro Yamaguchi, Yoshiki Nakamura
  Regular Languages That Can Be Approximated by Testing Subword Occurrences (written in Japanese)
  Computer Software, Vol. 40 No. 2, pp. 49--60, 2023,
  link


• Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya and Takeshi Tsukada
  Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence
  Logical Methods in Computer Science, February 22, 2019, Volume 15, Issue 1,
  link


• Ryoma Sin'ya
  A New Technique for Proving Non-Regularity based on the Measure of a Language (written in Japanese)
  Computer Software, Vol. 34 No.1, pp. 119--124, 2017,
  link


• Ryoma Sin'ya
  Text Compression using Abstract Numeration System on a Regular Language (written in Japanese)
  Computer Software, Vol 30. No.3, pp. 163--179, 2013,
  link


• Ryoma Sin'ya, Shigeo Mitsunari, Masataka Sassa
  Parallelization and Dynamic Code Generation for High-Speed Regular Expression Matching (written in Japanese)
  Computer Software, Vol 30. No.2, pp. 191--206, 2013,
  link

Doctoral Thesis:

• Ryoma Sin'ya
  Zero-One Law for Regular Languages
  Tokyo Institute of Technology, 2016,
  link

Talk (recent):

• Ryoma Sin'ya
  CLA 2020 (2020/11/12): A quantitative approach to the primitive words conjecture,
  video (on Youtube)


• Ryoma Sin'ya
  YR-OWLS (2020/10/30): Asymptotic Approximation by Regular Languages,
  video (on Youtube)

Book:

• 新屋 良磨，鈴木 勇介，高田 謙
  正規表現技術入門
  技術評論社，2015年4月14日初版発売,
  link

Survey:

• Ryoma Sin'ya
  Formal Language Theory: Between Commutativity and Non-Commutativity (written in Japanese)
  Bulletin of the Japan Society for Industrial and Applied Mathematics, Vol 31. Issue 4, pp. 15--22, 2021,
  link
  


• Ryoma Sin'ya
  Automata Theory Revised (written in Japanese)
  Computer Software, Vol 34. No.3, pp. 3--35, 2017,
  link
  

Award:

• 新屋良磨， 情報処理学会第 57 回プログラミング・シンポジウム 山内奨励賞(登壇発表 16 件中 1 件)，2017.
• 新屋良磨，第 18 回プログラミングおよびプログラミング言語ワークショップ 発表賞(登壇発表 27件中 3 件)，2016.
• 新屋良磨，情報処理学会プログラミング研究会2015年度コンピュータサイエンス領域奨励賞(プログラミング研究会における 2015 年度の全研究発表から 2 件)，2015.
• 新屋良磨，河野 真治， 情報処理学会第 52 回プログラミング・シンポジウム 山内奨励賞(登壇発表 22 件中 2 件)，2012.
• 新屋良磨，第 28 回日本ソフトウェア科学会全国大会 学生奨励賞(学生発表 114件中 2 件)，2011．