Ryo Yoshinaka

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.

[BibT_eX]

[DOI]

Davaajav Jargalsaikhan

Diptarama Hendrian

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Model-Based Development Considering Self-Driving Systems for Many-Core Processors.

[BibT_eX]

[DOI]

Takuya Azumi

Proceedings of the 25th IEEE International Conference on Emerging Technologies and Factory Automation, 2020

Grammar Compression with Probabilistic Context-Free Grammar.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2020

DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

Cyber-Enhanced Rescue Canine.

[BibT_eX]

[DOI]

Proceedings of the Disaster Robotics - Results from the ImPACT Tough Robotics Challenge, 2019

Efficient dynamic dictionary matching with DAWGs and AC-automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant.

[BibT_eX]

[DOI]

Jun Kawahara

Toshiki Saitoh

J. Graph Algorithms Appl., 2019

Distributional learning of conjunctive grammars and contextual binary feature grammars.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Query Learning Algorithm for Residual Symbolic Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Tenth International Symposium on Games, 2019

Linear-size Suffix Tries for Parameterized Strings.

[BibT_eX]

[DOI]

CoRR, 2019

Permuted Pattern Matching Algorithms on Multi-Track Strings.

[BibT_eX]

[DOI]

Algorithms, 2019

An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2019, 2019

Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

2018

Enumerating Cryptarithms Using Deterministic Finite Automata.

[BibT_eX]

[DOI]

CoRR, 2018

Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams.

[BibT_eX]

[DOI]

CoRR, 2018

Enumeration of Cryptarithms Using Deterministic Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2018

Linear-Time Online Algorithm Inferring the Shortest Path from a Walk.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2018

Duel and Sweep Algorithm for Order-Preserving Pattern Matching.

[BibT_eX]

[DOI]

Davaajav Jargalsaikhan

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Davaajav Jargalsaikhan

CoRR, 2017

Learning concepts and their unions from positive data with refinement operators.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2017

The Time Complexity of the Token Swapping Problem and Its Parallel Variants.

[BibT_eX]

[DOI]

Jun Kawahara

Toshiki Saitoh

Proceedings of the WALCOM: Algorithms and Computation, 2017

Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

The Strong, Weak, and Very Weak Finite Context and Kernel Properties.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2017

Micro-clustering by data polishing.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016

Probabilistic learnability of context-free grammars with basic distributional properties from positive examples.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

Distributional Learning of Some Nonlinear Tree Grammars.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2016, 2016

AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2016

QBF Encoding of Generalized Tic-Tac-Toe.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

CoRR, 2015

General Perspective on Distributionally Learnable Classes.

[BibT_eX]

[DOI]

Proceedings of the 14th Meeting on the Mathematics of Language, 2015

Learning Conjunctive Grammars and Contextual Binary Feature Grammars.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2015

Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars.

[BibT_eX]

[DOI]

Proceedings of the Formal Grammar - 20th and 21st International Conferences, 2015

2014

Distribution Loss Minimization With Guaranteed Error Bound.

[BibT_eX]

[DOI]

IEEE Trans. Smart Grid, 2014

The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

A comparison of collapsed Bayesian methods for probabilistic finite automata.

[BibT_eX]

[DOI]

Mach. Learn., 2014

Distributional learning of parallel multiple context-free grammars.

[BibT_eX]

[DOI]

Mach. Learn., 2014

An Algebraic Approach to Multiple Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the Logical Aspects of Computational Linguistics, 2014

A Sufficient Condition for Learning Unbounded Unions of Languages with Refinement Operators.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Preface.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory - 24th International Conference, 2013

2012

Marginalizing Out Transition Probabilities for Several Subclasses of PFAs.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Grammatical Inference, 2012

Beyond Semilinearity: Distributional Learning of Parallel Multiple Context-free Grammars.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Grammatical Inference, 2012

Counterexamples to the long-standing conjecture on the complexity of BDD binary operations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs.

[BibT_eX]

[DOI]

Algorithms, 2012

An Attempt Towards Learning Semantics: Distributional Learning of IO Context-Free Tree Grammars.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

2011

Efficient learning of multiple context-free languages with multidimensional substitutability from positive data.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2011, 2011

Distributional Learning of Abstract Categorial Grammars.

[BibT_eX]

[DOI]

Proceedings of the Logical Aspects of Computational Linguistics, 2011

Well-Nestedness Properly Subsumes Strict Derivational Minimalism.

[BibT_eX]

[DOI]

Proceedings of the Logical Aspects of Computational Linguistics, 2011

On the Parameterised Complexity of Learning Patterns.

[BibT_eX]

[DOI]

Frank Stephan

Thomas Zeugmann

Proceedings of the Computer and Information Sciences II, 2011

Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Distributional Learning of Simple Context-Free Tree Grammars.

[BibT_eX]

[DOI]

Anna Kasprzik

Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010

Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages.

[BibT_eX]

[DOI]

Yuichi Kaji

Hiroyuki Seki

Proceedings of the Language and Automata Theory and Applications, 2010

Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher.

[BibT_eX]

[DOI]

Proceedings of the Formal Grammar, 2010

2009

Learning efficiency of very simple grammars from positive data.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

An elementary proof of a generalization of double Greibach normal form.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008

An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

Identification in the Limit of k, l-Substitutable Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

2007

On Two Extensions of Abstract Categorial Grammars.

[BibT_eX]

[DOI]

Philippe de Groote

Sarah Maarek

Proceedings of the Logic for Programming, 2007

2006

Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning.

[BibT_eX]

[DOI]

Takeshi Shibata

Takashi Chikayama

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.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars.

[BibT_eX]

[DOI]