The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars. - Ryo Yoshinaka; Makoto Kanazawa (LACL, 2005)

Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete. - Ryo Yoshinaka (RTA, 2005)

Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning. - Takeshi Shibata; Ryo Yoshinaka; Takashi Chikayama (ALT, 2006)

Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data. - Ryo Yoshinaka (ICGI, 2006)

Learning Efficiency of Very Simple Grammars from Positive Data. - Ryo Yoshinaka (ALT, 2007)

On Two Extensions of Abstract Categorial Grammars. - Philippe de Groote; Sarah Maarek; Ryo Yoshinaka (LPAR, 2007)

Identification in the Limit of k, l-Substitutable Context-Free Languages. - Ryo Yoshinaka (ICGI, 2008)

An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs. - Ryo Yoshinaka (LATA, 2008)

Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data. - Ryo Yoshinaka (ALT, 2009)

An elementary proof of a generalization of double Greibach normal form. - Ryo Yoshinaka (Inf. Process. Lett., 2009)

Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher. - Ryo Yoshinaka; Alexander Clark (FG, 2010)

Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries. - Ryo Yoshinaka (ICGI, 2010)

Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages. - Ryo Yoshinaka; Yuichi Kaji; Hiroyuki Seki (LATA, 2010)

Distributional Learning of Simple Context-Free Tree Grammars. - Anna Kasprzik; Ryo Yoshinaka (ALT, 2011)

Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices. - Ryo Yoshinaka (Developments in Language Theory, 2011)

On the Parameterised Complexity of Learning Patterns. - Frank Stephan 001; Ryo Yoshinaka; Thomas Zeugmann (ISCIS, 2011)

Well-Nestedness Properly Subsumes Strict Derivational Minimalism. - Makoto Kanazawa; Jens Michaelis; Sylvain Salvati; Ryo Yoshinaka (LACL, 2011)

Distributional Learning of Abstract Categorial Grammars. - Ryo Yoshinaka; Makoto Kanazawa (LACL, 2011)

Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations. - Shuhei Denzumi; Ryo Yoshinaka; Hiroki Arimura; Shin-ichi Minato (PSC, 2011)

Efficient learning of multiple context-free languages with multidimensional substitutability from positive data. - Ryo Yoshinaka (Theor. Comput. Sci., 2011)

Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars. - Ryo Yoshinaka (LATA, 2012)

An Attempt Towards Learning Semantics: Distributional Learning of IO Context-Free Tree Grammars. - Ryo Yoshinaka (TAG, 2012)

Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs. - Ryo Yoshinaka; Toshiki Saitoh; Jun Kawahara; Koji Tsuruma; Hiroaki Iwashita; Shin-ichi Minato (Algorithms, 2012)

Counterexamples to the long-standing conjecture on the complexity of BDD binary operations. - Ryo Yoshinaka; Jun Kawahara; Shuhei Denzumi; Hiroki Arimura; Shin-ichi Minato (Inf. Process. Lett., 2012)

Beyond Semilinearity: Distributional Learning of Parallel Multiple Context-free Grammars. - Alexander Clark; Ryo Yoshinaka (ICGI, 2012)

Marginalizing Out Transition Probabilities for Several Subclasses of PFAs. - Chihiro Shibata; Ryo Yoshinaka (ICGI, 2012)

PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data. - Chihiro Shibata; Ryo Yoshinaka (ALT, 2013)

Preface. - Alexander Clark; Makoto Kanazawa; Ryo Yoshinaka (ICGI, 2014)

A Sufficient Condition for Learning Unbounded Unions of Languages with Refinement Operators. - Tomohiko Okayama; Ryo Yoshinaka; Keisuke Otaki; Akihiro Yamamoto (ISAIM, 2014)

An Algebraic Approach to Multiple Context-Free Grammars. - Alexander Clark; Ryo Yoshinaka (LACL, 2014)

Distributional learning of parallel multiple context-free grammars. - Alexander Clark; Ryo Yoshinaka (Mach. Learn., 2014)

A comparison of collapsed Bayesian methods for probabilistic finite automata. - Chihiro Shibata; Ryo Yoshinaka (Mach. Learn., 2014)

The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages. - Makoto Kanazawa; Gregory M. Kobele; Jens Michaelis; Sylvain Salvati; Ryo Yoshinaka (Theory Comput. Syst., 2014)

Distribution Loss Minimization With Guaranteed Error Bound. - Takeru Inoue; Keiji Takano; Takayuki Watanabe; Jun Kawahara; Ryo Yoshinaka; Akihiro Kishimoto; Koji Tsuda; Shin-ichi Minato; Yasuhiro Hayashi (IEEE Trans. Smart Grid, 2014)

Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars. - Makoto Kanazawa; Ryo Yoshinaka (FG, 2015)

Learning Conjunctive Grammars and Contextual Binary Feature Grammars. - Ryo Yoshinaka (LATA, 2015)

General Perspective on Distributionally Learnable Classes. - Ryo Yoshinaka (MOL, 2015)

Micro-Clustering: Finding Small Clusters in Large Diversity. - Takeaki Uno; Hiroki Maegawa; Takanobu Nakahara; Yukinobu Hamuro; Ryo Yoshinaka; Makoto Tatsuta (CoRR, 2015)

QBF Encoding of Generalized Tic-Tac-Toe. - Diptarama; Ryo Yoshinaka; Ayumi Shinohara (QBF@SAT, 2016)

AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching. - Diptarama; Ryo Yoshinaka; Ayumi Shinohara (SPIRE, 2016)

Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings. - Diptarama; Ryo Yoshinaka; Ayumi Shinohara (PSC, 2016)

Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations. - Shuhei Denzumi; Ryo Yoshinaka; Hiroki Arimura; Shin-ichi Minato (Discret. Appl. Math., 2016)

Distributional Learning of Some Nonlinear Tree Grammars. - Alexander Clark; Makoto Kanazawa; Gregory M. Kobele; Ryo Yoshinaka (Fundam. Informaticae, 2016)

Preface. - Rémi Eyraud; Colin de la Higuera; Makoto Kanazawa; Ryo Yoshinaka (Fundam. Informaticae, 2016)

Probabilistic learnability of context-free grammars with basic distributional properties from positive examples. - Chihiro Shibata; Ryo Yoshinaka (Theor. Comput. Sci., 2016)

An efficient query learning algorithm for zero-suppressed binary decision diagrams. - Hayato Mizumoto; Shota Todoroki; Diptarama; Ryo Yoshinaka; Ayumi Shinohara (ALT, 2017)

Micro-clustering by data polishing. - Takeaki Uno; Hiroki Maegawa; Takanobu Nakahara; Yukinobu Hamuro; Ryo Yoshinaka; Makoto Tatsuta (IEEE BigData, 2017)

The Strong, Weak, and Very Weak Finite Context and Kernel Properties. - Makoto Kanazawa; Ryo Yoshinaka (LATA, 2017)

Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings. - Yohei Ueki; Diptarama; Masatoshi Kurihara; Yoshiaki Matsuoka; Kazuyuki Narisawa; Ryo Yoshinaka; Hideo Bannai; Shunsuke Inenaga; Ayumi Shinohara (SOFSEM, 2017)

The Time Complexity of the Token Swapping Problem and Its Parallel Variants. - Jun Kawahara; Toshiki Saitoh; Ryo Yoshinaka (WALCOM, 2017)

Learning concepts and their unions from positive data with refinement operators. - Seishi Ouchi; Tomohiko Okayama; Keisuke Otaki; Ryo Yoshinaka; Akihiro Yamamoto (Ann. Math. Artif. Intell., 2017)

Duel and sweep algorithm for order-preserving pattern matching. - Davaajav Jargalsaikhan; Diptarama; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2017)

New Variants of Pattern Matching with Constants and Variables. - Yuki Igarashi; Diptarama; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM, 2018)

Duel and Sweep Algorithm for Order-Preserving Pattern Matching. - Davaajav Jargalsaikhan; Diptarama; Yohei Ueki; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM, 2018)

Linear-Time Online Algorithm Inferring the Shortest Path from a Walk. - Shintaro Narisada; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SPIRE, 2018)

Enumeration of Cryptarithms Using Deterministic Finite Automata. - Yuki Nozaki; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (CIAA, 2018)

Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams. - Jun Kawahara; Toshiki Saitoh; Hirofumi Suzuki; Ryo Yoshinaka (CoRR, 2018)

Enumerating Cryptarithms Using Deterministic Finite Automata. - Yuki Nozaki; Diptarama Hendrian; Ryo Yoshinaka; Takashi Horiyama; Ayumi Shinohara (CoRR, 2018)

Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs. - Jun Kawahara; Toshiki Saitoh; Hirofumi Suzuki; Ryo Yoshinaka (SEA², 2019)

An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm. - Satoshi Kobayashi; Diptarama; Ryo Yoshinaka; Ayumi Shinohara (PSC, 2019)

Permuted Pattern Matching Algorithms on Multi-Track Strings. - Diptarama Hendrian; Yohei Ueki; Kazuyuki Narisawa; Ryo Yoshinaka; Ayumi Shinohara (Algorithms, 2019)

Linear-size Suffix Tries for Parameterized Strings. - Katsuhito Nakashima; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2019)

Query Learning Algorithm for Residual Symbolic Finite Automata. - Kaizaburo Chubachi; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (GandALF, 2019)

Distributional learning of conjunctive grammars and contextual binary feature grammars. - Ryo Yoshinaka (J. Comput. Syst. Sci., 2019)

The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant. - Jun Kawahara; Toshiki Saitoh; Ryo Yoshinaka (J. Graph Algorithms Appl., 2019)

Efficient dynamic dictionary matching with DAWGs and AC-automata. - Diptarama Hendrian; Shunsuke Inenaga; Ryo Yoshinaka; Ayumi Shinohara (Theor. Comput. Sci., 2019)

Cyber-Enhanced Rescue Canine. - Kazunori Ohno; Ryunosuke Hamada; Tatsuya Hoshi; Hiroyuki Nishinoma; Shumpei Yamaguchi; Solvi Arnold; Kimitoshi Yamazaki; Takefumi Kikusui; Satoko Matsubara; Miho Nagasawa; Takatomi Kubo; Eri Nakahara; et al. (Disaster Robotics, 2019)

DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. - Katsuhito Nakashima; Noriki Fujisato; Diptarama Hendrian; Yuto Nakashima 001; Ryo Yoshinaka; Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Masayuki Takeda (CPM, 2020)

Grammar Compression with Probabilistic Context-Free Grammar. - Hiroaki Naganuma; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara; Naoki Kobayashi 001 (DCC, 2020)

Model-Based Development Considering Self-Driving Systems for Many-Core Processors. - Ryo Yoshinaka; Takuya Azumi (ETFA, 2020)

Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching. - Davaajav Jargalsaikhan; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM, 2020)

An Extension of Linear-size Suffix Tries for Parameterized Strings. - Katsuhito Nakashima; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM (Doctoral Student Research Forum), 2020)

AOBA: An Online Benchmark Tool for Algorithms in Stringology. - Ryu Wakimoto; Satoshi Kobayashi; Yuki Igarashi; Davaajav Jargalsaikhan; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM (Doctoral Student Research Forum), 2020)

Computing Covers Under Substring Consistent Equivalence Relations. - Natsumi Kikuchi; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SPIRE, 2020)

Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences. - Satoshi Kobayashi; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SEA, 2020)

Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes. - Toshiki Saitoh; Ryo Yoshinaka; Hans L. Bodlaender (CoRR, 2020)

Linear-time online algorithm for inferring the shortest path graph from a walk label. - Shintaro Narisada; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (Theor. Comput. Sci., 2020)

Inside-Outside Algorithm for Macro Grammars. - Ryuta Kambe; Naoki Kobayashi 001; Ryosuke Sato 001; Ayumi Shinohara; Ryo Yoshinaka (ICGI, 2021)

A Hierarchy of Context-Free Languages Learnable from Positive Data and Membership Queries. - Makoto Kanazawa; Ryo Yoshinaka (ICGI, 2021)

Query Learning Algorithm for Symbolic Weighted Finite Automata. - Kaito Suzuki; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (ICGI, 2021)

Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. - Toshiki Saitoh; Ryo Yoshinaka; Hans L. Bodlaender (WALCOM, 2021)

Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations. - Davaajav Jargalsaikhan; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (CPM, 2022)

Sorting Balls and Water: Equivalence and Computational Complexity. - Takehiro Ito; Jun Kawahara; Shin-ichi Minato; Yota Otachi; Toshiki Saitoh; Akira Suzuki 001; Ryuhei Uehara; Takeaki Uno; Katsuhisa Yamanaka; Ryo Yoshinaka (FUN, 2022)

Computing the Parameterized Burrows-Wheeler Transform Online. - Daiki Hashimoto; Diptarama Hendrian; Dominik Köppl; Ryo Yoshinaka; Ayumi Shinohara (SPIRE, 2022)

Parameterized DAWGs: Efficient constructions and bidirectional pattern searches. - Katsuhito Nakashima; Noriki Fujisato; Diptarama Hendrian; Yuto Nakashima 001; Ryo Yoshinaka; Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Masayuki Takeda (Theor. Comput. Sci., 2022)

Extending Distributional Learning from Positive Data and Membership Queries. - Makoto Kanazawa; Ryo Yoshinaka (ICGI, 2023)

Identification of Substitutable Context-Free Languages over Infinite Alphabets from Positive Data. - Yutaro Numaya; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (ICGI, 2023)

Efficient Parameterized Pattern Matching in Sublinear Space. - Haruki Ideguchi; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SPIRE, 2023)

Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs. - Jun Kawahara; Toshiki Saitoh; Hirokazu Takeda; Ryo Yoshinaka; Yui Yoshioka (WALCOM, 2023)

Inferring Strings from Position Heaps in Linear Time. - Koshiro Kumagai; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (WALCOM, 2023)

Algorithms for Galois Words: Detection, Factorization, and Rotation. - Diptarama Hendrian; Dominik Köppl; Ryo Yoshinaka; Ayumi Shinohara (CPM, 2024)

Parallelized Code Generation from Simulink Models for Event-driven and Timer-driven ROS 2 Nodes. - Kenshin Obi; Ryo Yoshinaka; Hiroshi Fujimoto; Takuya Azumi (SEAA, 2024)

Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. - Kento Iseri; Tomohiro I; Diptarama Hendrian; Dominik Köppl; Ryo Yoshinaka; Ayumi Shinohara (ICALP, 2024)

Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages. - Yoshito Kawasaki; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM, 2024)

Subsequence Pattern Matching with Segment Number Constraint. - Yuki Yonemoto; Takuya Mieno; Shunsuke Inenaga; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2024)

Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes. - Jun Kawahara; Toshiki Saitoh; Hirokazu Takeda; Ryo Yoshinaka; Yui Yoshioka (Theor. Comput. Sci., 2024)

Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm. - Davaajav Jargalsaikhan; Diptarama Hendrian; Yohei Ueki; Ryo Yoshinaka; Ayumi Shinohara (Acta Informatica, 2024)

Subsequence Matching and LCS with Segment Number Constraints. - Yuki Yonemoto; Takuya Mieno; Shunsuke Inenaga; Ryo Yoshinaka; Ayumi Shinohara (CIAC (2), 2025)

Pattern Matching on Run-Length Grammar-Compressed Strings in Linear Time. - Yuto Iguchi; Ryo Yoshinaka; Ayumi Shinohara (CPM, 2025)

Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets. - Yutaro Numaya; Yoshito Kawasaki; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM (2), 2025)

StrNim: a variant of Nim played on strings. - Shota Mizuno; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2025)

BusOut is NP-complete. - Takehiro Ishibashi; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2025)

Misère Greedy Nim and Misère Bounded Greedy Nim. - Nanako Omiya; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2025)

Finding Order-Preserving Subgraphs. - Haruya Imamura; Yasuaki Kobayashi; Yota Otachi; Toshiki Saitoh; Keita Sato; Asahi Takaoka; Ryo Yoshinaka; Tom C. van der Zanden (CoRR, 2025)

Solvable Tuple Patterns and Their Applications to Program Verification. - Naoki Kobayashi 001; Ryosuke Sato 001; Ayumi Shinohara; Ryo Yoshinaka (CoRR, 2025)