( en | de | ru )

 

Disambiguation of "Arimura, Hiroki"

Author of the publication

copydeleteadd this publication to your clipboard
Learning elementary formal systems with queries.

, , and . Theor. Comput. Sci., 298 (1): 21-50 (2003)

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.

Hiroki Takahashi

Hiroki Kawamura

Hiroki Sumizawa

 

Other publications of authors with the same name

Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism., and . IWOCA, volume 6460 of Lecture Notes in Computer Science, page 68-81. Springer, (2010)Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 100-A (9): 1785-1793 (2017)Learning Unions of Tree Patterns Using Queries., , and . Theor. Comput. Sci., 185 (1): 47-62 (1997)Learning elementary formal systems with queries., , and . Theor. Comput. Sci., 298 (1): 21-50 (2003)Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts., , , , and . Algorithmica, 82 (5): 1346-1377 (2020)Trajectory Pattern Mining in Practice - Algorithms for Mining Flock Patterns from Trajectories., , and . KDIR/KMIS, page 143-151. SciTePress, (2013)Multi-Layered Framework for Modeling Relationships between Biased Objects., , and . SDM, page 819-827. SIAM, (2015)Implementation of sequence BDDs in Erlang., , and . Erlang Workshop, page 90-91. ACM, (2011)Efficient Text Mining with Optimized Pattern Discovery.. CPM, volume 2373 of Lecture Notes in Computer Science, page 17-19. Springer, (2002)An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees., and . ILP, volume 3625 of Lecture Notes in Computer Science, page 1-19. Springer, (2005)