Ryo Yoshinaka

According to our database1, Ryo Yoshinaka authored at least 92 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023
Sorting balls and water: Equivalence and computational complexity.
Theor. Comput. Sci., November, 2023

Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching.
CoRR, 2023

Inferring Strings from Position Heaps in Linear Time.
Proceedings of the WALCOM: Algorithms and Computation, 2023

Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 2023

Efficient Parameterized Pattern Matching in Sublinear Space.
Proceedings of the String Processing and Information Retrieval, 2023

Identification of Substitutable Context-Free Languages over Infinite Alphabets from Positive Data.
Proceedings of the International Conference on Grammatical Inference, 2023

Extending Distributional Learning from Positive Data and Membership Queries.
Proceedings of the International Conference on Grammatical Inference, 2023

2022
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches.
Theor. Comput. Sci., 2022

Computing the Parameterized Burrows-Wheeler Transform Online.
Proceedings of the String Processing and Information Retrieval, 2022

Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Query Learning Algorithm for Symbolic Weighted Finite Automata.
Proceedings of the 15th International Conference on Grammatical Inference, 2021

A Hierarchy of Context-Free Languages Learnable from Positive Data and Membership Queries.
Proceedings of the 15th International Conference on Grammatical Inference, 2021

Inside-Outside Algorithm for Macro Grammars.
Proceedings of the 15th International Conference on Grammatical Inference, 2021

2020
Linear-time online algorithm for inferring the shortest path graph from a walk label.
Theor. Comput. Sci., 2020

Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes.
CoRR, 2020

Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Computing Covers Under Substring Consistent Equivalence Relations.
Proceedings of the String Processing and Information Retrieval, 2020

AOBA: An Online Benchmark Tool for Algorithms in Stringology.
Proceedings of the SOFSEM 2020 Doctoral Student Research Forum co-located with the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), 2020

An Extension of Linear-size Suffix Tries for Parameterized Strings.
Proceedings of the SOFSEM 2020 Doctoral Student Research Forum co-located with the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), 2020

Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Model-Based Development Considering Self-Driving Systems for Many-Core Processors.
Proceedings of the 25th IEEE International Conference on Emerging Technologies and Factory Automation, 2020

Grammar Compression with Probabilistic Context-Free Grammar.
Proceedings of the Data Compression Conference, 2020

DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

Efficient dynamic dictionary matching with DAWGs and AC-automata.
Theor. Comput. Sci., 2019

The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant.
J. Graph Algorithms Appl., 2019

Distributional learning of conjunctive grammars and contextual binary feature grammars.
J. Comput. Syst. Sci., 2019

Query Learning Algorithm for Residual Symbolic Finite Automata.
Proceedings of the Proceedings Tenth International Symposium on Games, 2019

Linear-size Suffix Tries for Parameterized Strings.
CoRR, 2019

Permuted Pattern Matching Algorithms on Multi-Track Strings.
Algorithms, 2019

An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm.
Proceedings of the Prague Stringology Conference 2019, 2019

Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

2018
Enumerating Cryptarithms Using Deterministic Finite Automata.
CoRR, 2018

Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams.
CoRR, 2018

Enumeration of Cryptarithms Using Deterministic Finite Automata.
Proceedings of the Implementation and Application of Automata, 2018

Linear-Time Online Algorithm Inferring the Shortest Path from a Walk.
Proceedings of the String Processing and Information Retrieval, 2018

Duel and Sweep Algorithm for Order-Preserving Pattern Matching.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

New Variants of Pattern Matching with Constants and Variables.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2017
Duel and sweep algorithm for order-preserving pattern matching.
CoRR, 2017

Learning concepts and their unions from positive data with refinement operators.
Ann. Math. Artif. Intell., 2017

The Time Complexity of the Token Swapping Problem and Its Parallel Variants.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

The Strong, Weak, and Very Weak Finite Context and Kernel Properties.
Proceedings of the Language and Automata Theory and Applications, 2017

Micro-clustering by data polishing.
Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017

An efficient query learning algorithm for zero-suppressed binary decision diagrams.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016
Probabilistic learnability of context-free grammars with basic distributional properties from positive examples.
Theor. Comput. Sci., 2016

Preface.
Fundam. Informaticae, 2016

Distributional Learning of Some Nonlinear Tree Grammars.
Fundam. Informaticae, 2016

Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations.
Discret. Appl. Math., 2016

Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings.
Proceedings of the Prague Stringology Conference 2016, 2016

AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching.
Proceedings of the String Processing and Information Retrieval, 2016

QBF Encoding of Generalized Tic-Tac-Toe.
Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016), 2016

2015
Micro-Clustering: Finding Small Clusters in Large Diversity.
CoRR, 2015

General Perspective on Distributionally Learnable Classes.
Proceedings of the 14th Meeting on the Mathematics of Language, 2015

Learning Conjunctive Grammars and Contextual Binary Feature Grammars.
Proceedings of the Language and Automata Theory and Applications, 2015

Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars.
Proceedings of the Formal Grammar - 20th and 21st International Conferences, 2015

2014
Distribution Loss Minimization With Guaranteed Error Bound.
IEEE Trans. Smart Grid, 2014

The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages.
Theory Comput. Syst., 2014

A comparison of collapsed Bayesian methods for probabilistic finite automata.
Mach. Learn., 2014

Distributional learning of parallel multiple context-free grammars.
Mach. Learn., 2014

An Algebraic Approach to Multiple Context-Free Grammars.
Proceedings of the Logical Aspects of Computational Linguistics, 2014

A Sufficient Condition for Learning Unbounded Unions of Languages with Refinement Operators.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Preface.
Proceedings of the 12th International Conference on Grammatical Inference, 2014

2013
PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data.
Proceedings of the Algorithmic Learning Theory - 24th International Conference, 2013

2012
Marginalizing Out Transition Probabilities for Several Subclasses of PFAs.
Proceedings of the Eleventh International Conference on Grammatical Inference, 2012

Beyond Semilinearity: Distributional Learning of Parallel Multiple Context-free Grammars.
Proceedings of the Eleventh International Conference on Grammatical Inference, 2012

Counterexamples to the long-standing conjecture on the complexity of BDD binary operations.
Inf. Process. Lett., 2012

Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs.
Algorithms, 2012

An Attempt Towards Learning Semantics: Distributional Learning of IO Context-Free Tree Grammars.
Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2012

Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars.
Proceedings of the Language and Automata Theory and Applications, 2012

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

Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations.
Proceedings of the Prague Stringology Conference 2011, 2011

Distributional Learning of Abstract Categorial Grammars.
Proceedings of the Logical Aspects of Computational Linguistics, 2011

Well-Nestedness Properly Subsumes Strict Derivational Minimalism.
Proceedings of the Logical Aspects of Computational Linguistics, 2011

On the Parameterised Complexity of Learning Patterns.
Proceedings of the Computer and Information Sciences II, 2011

Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Distributional Learning of Simple Context-Free Tree Grammars.
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010
Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages.
Proceedings of the Language and Automata Theory and Applications, 2010

Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries.
Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher.
Proceedings of the Formal Grammar, 2010

2009
Learning efficiency of very simple grammars from positive data.
Theor. Comput. Sci., 2009

An elementary proof of a generalization of double Greibach normal form.
Inf. Process. Lett., 2009

Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008
An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs.
Proceedings of the Language and Automata Theory and Applications, 2008

Identification in the Limit of k, l-Substitutable Context-Free Languages.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

2007
On Two Extensions of Abstract Categorial Grammars.
Proceedings of the Logic for Programming, 2007

2006
Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning.
Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2005
Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars.
Proceedings of the Logical Aspects of Computational Linguistics, 2005


  Loading...