( en | de | ru )

 

Disambiguation of "Shoudai, Takayoshi"

Author of the publication

copydeleteadd this publication to your clipboard
Exact Learning of Primitive Formal Systems Defining Labeled Ordered Tree Languages via Queries.

, , , , and . IEICE Trans. Inf. Syst., 102-D (3): 470-482 (2019)

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.

No persons found for author name Shoudai, Takayoshi
add a person with the name Shoudai, Takayoshi
 

Other publications of authors with the same name

Inductive Inference of Regular Term Free Languages and Its Application to Knowledge Discovery., , , and . EJC, volume 61 of Frontiers in Artificial Intelligence and Applications, page 85-102. IOS Press, (1999)An Efficient Pattern Matching Algorithm for Unordered Term Tree Patterns of Bounded Dimension., , , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 101-A (9): 1344-1354 (2018)An Efficient Pattern Matching Algorithm for Ordered Term Tree Patterns., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 98-A (6): 1197-1211 (2015)Graph Contraction Pattern Matching for Graphs of Bounded Treewidth., and . ILP (Late Breaking Papers), page 173-180. Imperial College Press / World Scientific, (2011)Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data., , , and . ILP, volume 2835 of Lecture Notes in Computer Science, page 347-364. Springer, (2003)Distributional Learning of Regular Formal Graph System of Bounded Degree., , and . ILP, volume 10326 of Lecture Notes in Computer Science, page 68-80. Springer, (2016)Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries., , , , and . ALT, volume 2842 of Lecture Notes in Computer Science, page 144-158. Springer, (2003)Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data., , , and . ALT, volume 2533 of Lecture Notes in Computer Science, page 188-202. Springer, (2002)Exact Learning of Finite Unions of Graph Patterns from Queries., , , , and . ALT, volume 4754 of Lecture Notes in Computer Science, page 298-312. Springer, (2007)The Lexicographically First Topological Order Problem is NLOG-Complete.. Inf. Process. Lett., 33 (3): 121-124 (1989)