( en | de | ru )

 

Disambiguation of "Yoshinaka, Ryo"

Author of the publication

copydeleteadd this publication to your clipboard
Distributional Learning of Some Nonlinear Tree Grammars.

, , , and . Fundam. Informaticae, 146 (4): 339-377 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ryo Sugihara

Ryo Kohsaka

Jong Won Ryoo

So Young Ryou

Mun Il Ryoo

 

Other publications of authors with the same name

Extending Distributional Learning from Positive Data and Membership Queries., and . ICGI, volume 217 of Proceedings of Machine Learning Research, page 8-22. PMLR, (2023)Distribution Loss Minimization With Guaranteed Error Bound., , , , , , , , and . IEEE Trans. Smart Grid, 5 (1): 102-111 (2014)Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations., , , and . Stringology, page 147-161. Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2011)Distributional Learning and Context/Substructure Enumerability in Nonlinear Tree Grammars., and . FG, volume 9804 of Lecture Notes in Computer Science, page 94-111. Springer, (2015)Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher., and . FG, volume 7395 of Lecture Notes in Computer Science, page 192-207. Springer, (2010)Distributional Learning of Simple Context-Free Tree Grammars., and . ALT, volume 6925 of Lecture Notes in Computer Science, page 398-412. Springer, (2011)On Two Extensions of Abstract Categorial Grammars., , and . LPAR, volume 4790 of Lecture Notes in Computer Science, page 273-287. Springer, (2007)Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete.. RTA, volume 3467 of Lecture Notes in Computer Science, page 235-249. Springer, (2005)Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data.. ICGI, volume 4201 of Lecture Notes in Computer Science, page 45-58. Springer, (2006)The Complexity and Generative Capacity of Lexicalized Abstract Categorial Grammars., and . LACL, volume 3492 of Lecture Notes in Computer Science, page 330-346. Springer, (2005)