( en | de | ru )

 

Disambiguation of "Ito, Masami"

Author of the publication

copydeleteadd this publication to your clipboard
Some Results on Directable Automata.

, and . Theory Is Forever, volume 3113 of Lecture Notes in Computer Science, page 125-133. Springer, (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. You can also use the button next to the name to display some publications already assigned to the person.

Nobutaka Ito

Takao Ito

Akio Ito

Takuro Ito

Hisao Ito

 

Other publications of authors with the same name

Decomposition and Parallel Learning of Imbalanced Classification Problems by Min-Max Modular Neural Network., and . ICONIP, page 199-202. IOA Press, (1998)Decomposing and Parallel Learning of Large-Scale Pattern Recognition Problems using Min-Max Modular Neural Network., and . NC, page 703-709. ICSC Academic Press, International Computer Science Conventions, Canada / Switzerland, (1998)Some Remarks on Primitive Words and Palindromes., , , and . DCFS, page 245-254. MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary, (2003)A Parsing Problem for Context-Sensitive Languages., and . Words, Languages & Combinatorics, page 183-184. World Scientific, (2000)Bounded Hairpin Completion., , and . LATA, volume 5457 of Lecture Notes in Computer Science, page 434-445. Springer, (2009)Duplication in DNA Sequences., , , and . Developments in Language Theory, volume 5257 of Lecture Notes in Computer Science, page 419-430. Springer, (2008)Internal observation systems and a theory of reaction-diffusion equation on a graph., and . SMC, page 3669-3673. IEEE, (1998)Autonomous decentralized system with self-organizing function and its application to generation of locomotive patterns., and . ISADS, page 130-136. IEEE Computer Society, (1993)On Some Special Classes of Regular Languages., and . Jewels are Forever, page 25-34. Springer, (1999)On Commutative Directable Nondeterministic Automata., , and . Grammars and Automata for String Processing, volume 9 of Topics in Computer Mathematics, page 141-150. Taylor and Francis, (2003)