The following pages link to Ryo Yoshinaka (Q249065):
Displayed 50 items.
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- Counterexamples to the long-standing conjecture on the complexity of BDD binary operations (Q456068) (← links)
- Distributional learning of parallel multiple context-free grammars (Q479454) (← links)
- A comparison of collapsed Bayesian methods for probabilistic finite automata (Q479467) (← links)
- Learning concepts and their unions from positive data with refinement operators (Q513348) (← links)
- An elementary proof of a generalization of double Greibach normal form (Q987803) (← links)
- Learning efficiency of very simple grammars from positive data (Q1017659) (← links)
- Enumeration of cryptarithms using deterministic finite automata (Q1616985) (← links)
- Finding all solutions and instances of Numberlink and Slitherlink by ZDDs (Q1736507) (← links)
- AC-automaton update algorithm for semi-dynamic dictionary matching (Q1796836) (← links)
- Permuted pattern matching algorithms on multi-track strings (Q2003324) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- The failure of the strong pumping lemma for multiple context-free languages (Q2254497) (← links)
- Linear-time online algorithm for inferring the shortest path graph from a walk label (Q2297861) (← links)
- Efficient dynamic dictionary matching with DAWGs and AC-automata (Q2326393) (← links)
- Distributional learning of conjunctive grammars and contextual binary feature grammars (Q2424694) (← links)
- Efficient learning of multiple context-free languages with multidimensional substitutability from positive data (Q2431429) (← links)
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches (Q2676460) (← links)
- Learning Conjunctive Grammars and Contextual Binary Feature Grammars (Q2799213) (← links)
- Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars (Q2835046) (← links)
- PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data (Q2859212) (← links)
- Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars (Q2890226) (← links)
- Efficiency in the Identification in the Limit Learning Paradigm (Q2963593) (← links)
- Distributional Learning of Context-Free and Multiple Context-Free Grammars (Q2963597) (← links)
- Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings (Q2971148) (← links)
- The Time Complexity of the Token Swapping Problem and Its Parallel Variants (Q2980932) (← links)
- Well-Nestedness Properly Subsumes Strict Derivational Minimalism (Q3010340) (← links)
- Distributional Learning of Abstract Categorial Grammars (Q3010353) (← links)
- Distributional Learning of Simple Context-Free Tree Grammars (Q3093967) (← links)
- Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher (Q3167310) (← links)
- Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching (Q3297770) (← links)
- On Two Extensions of Abstract Categorial Grammars (Q3498472) (← links)
- Learning Efficiency of Very Simple Grammars from Positive Data (Q3520062) (← links)
- Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning (Q3522998) (← links)
- Identification in the Limit of k,l-Substitutable Context-Free Languages (Q3528426) (← links)
- An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs (Q3540139) (← links)
- Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data (Q3541844) (← links)
- Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages (Q3564899) (← links)
- Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries (Q3588380) (← links)
- Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data (Q3648758) (← links)
- (Q4599200) (← links)
- The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant (Q4622770) (← links)
- (Q4645655) (← links)
- Distributional Learning of Some Nonlinear Tree Grammars (Q4976383) (← links)
- An Algebraic Approach to Multiple Context-Free Grammars (Q4981268) (← links)
- (Q5020531) (← links)
- New Variants of Pattern Matching with Constants and Variables (Q5127199) (← links)
- Duel and Sweep Algorithm for Order-Preserving Pattern Matching (Q5127200) (← links)
- Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices (Q5199987) (← links)
- Term Rewriting and Applications (Q5703852) (← links)
