( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Subclasses of Tree Adjoining Grammar for RNA Secondary Structure.

, , и . TAG+, стр. 48-55. Simon Fraser University, (2004)

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.

Tadao Johannes Araki

 

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

Functional Programming and Logical Programming for the Telegram Analysis Problem., , , и . ICSE, стр. 463-472. IEEE Computer Society, (1984)An approximation to the weight distribution of binary linear codes., , и . IEEE Trans. Inf. Theory, 31 (6): 769-780 (1985)Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel., , , и . IEEE Trans. Inf. Theory, 29 (1): 114-130 (1983)Linear block codes for error detection., , и . IEEE Trans. Inf. Theory, 29 (1): 131-136 (1983)Verification of safeness and mutual exclusion properties of algebraically specified token ring LAN protocol., , , , и . Syst. Comput. Jpn., 20 (5): 57-68 (1989)On the maximum value of aliasing probabilities for single input signature registers., , , и . VTS, стр. 267-274. IEEE Computer Society, (1993)The Split Weight (wL, wR) Enumeration of Reed-Muller Codes for wL + wR < 2dmin., , и . AAECC, том 1255 из Lecture Notes in Computer Science, стр. 197-211. Springer, (1997)On equivalence of safe Petri nets., , , и . FCT, стр. 430-436. Akademie-Verlag, Berlin, (1979)An upper bound on k/n for affine-invariant codes with fixed d/n (Corresp.).. IEEE Trans. Inf. Theory, 15 (1): 174-176 (1969)Suboptimum decoding of decomposable block codes., , , , и . IEEE Trans. Inf. Theory, 40 (5): 1392-1405 (1994)