( en | de | ru )

 

Disambiguation of "Wakatsuki, Mitsuo"

Author of the publication

copydeleteadd this publication to your clipboard
A source code plagiarism detecting method using alignment with abstract syntax tree elements.

, , , and . SNPD, page 1-6. IEEE Computer Society, (2014)

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.

Hirotaka Wakatsuki

Mitsuo Hori

Mitsuo Kitagawa

 

Other publications of authors with the same name

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data., , and . ICGI, volume 3264 of Lecture Notes in Computer Science, page 260-272. Springer, (2004)A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata, , and . TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems, (1995)A Source Code Plagiarism Detecting Method Using Sequence Alignment with Abstract Syntax Tree Elements., , , and . Int. J. Softw. Innov., 3 (3): 41-56 (2015)Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers., and . ICGI, volume 6339 of Lecture Notes in Computer Science, page 313-316. Springer, (2010)A source code plagiarism detecting method using alignment with abstract syntax tree elements., , , and . SNPD, page 1-6. IEEE Computer Society, (2014)A Polynomial-Time Algorithm for Checking the Equivalence for Real-Time Deterministic Restricted One-Counter Transducers Which Accept by Final State., , and . SNPD, page 459-465. IEEE Computer Society, (2013)A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data., , and . ICGI, volume 4201 of Lecture Notes in Computer Science, page 161-174. Springer, (2006)A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Accept Mode, , and . TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems, (1998)A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique., , , , , and . FAW, volume 9711 of Lecture Notes in Computer Science, page 215-226. Springer, (2016)What are the Characteristics of the Card Game Daihinmin?, , , , and . IIAI-AAI, page 587-592. IEEE, (2019)