( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computer Science Education for Primary and Lower Secondary School Students: Teaching the Concept of Automata.

, , , и . ACM Trans. Comput. Educ., 17 (1): 2:1-2:28 (2017)

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.

Koichi Matsumoto

Satoko Yamazaki

Koichi Koshi

Koichi Morikawa

Noboru Yamazaki

 

Другие публикации лиц с тем же именем

Inapproximability of Rank, Clique, Boolean, and Maximum Induced Matching-Widths under Small Set Expansion Hypothesis.. Algorithms, 11 (11): 173 (2018)How to Solve the Torus Puzzle., , , , , , , и . Algorithms, 5 (1): 18-29 (2012)Tangle and Ultrafilter: Game Theoretical Interpretation., и . Graphs Comb., 36 (2): 319-330 (2020)A note on greedy algorithms for the maximum weighted independent set problem., , и . Discret. Appl. Math., 126 (2-3): 313-322 (2003)Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs., , и . Discret. Appl. Math., 155 (17): 2383-2390 (2007)A Normal Form Problem for Unlabeled Boundary NLC Graph Languages. Inf. Comput., 120 (1): 1-10 (июля 1995)Tangle and Maximal Ideal.. WALCOM, том 10167 из Lecture Notes in Computer Science, стр. 81-92. Springer, (2017)A Hierarchy of the Class of Apex NLC Graph Languages by Bounds on the Number of Nonterminal Nodes in Productions.. Acta Inf., 34 (5): 325-335 (1997)Isomorphism for Graphs of Bounded Distance Width., , , и . CIAC, том 1203 из Lecture Notes in Computer Science, стр. 276-287. Springer, (1997)Learning of Restricted RNLC Graph Languages., и . ISAAC, том 1004 из Lecture Notes in Computer Science, стр. 171-180. Springer, (1995)