Hamaguchi K | Osaka Univ. Toyonaka‐shi Jpn
スポンサーリンク
概要
関連著者
-
Hamaguchi K
Osaka Univ. Toyonaka‐shi Jpn
-
Hamaguchi Kiyoharu
The Graduate School Of Information Science And Technology Osaka University
-
Hamaguchi Kiyoharu
Department Of Bioinformatic Engineering Guraduate School Of Information Science And Technology Osaka
-
Kashiwabara Toshinobu
The Graduate School Of Information Science And Technology Osaka University
-
Kashiwabara Toshinobu
The Department Of Information And Computer Sciences Osaka University
-
Nakanishi Masaki
The Graduate School Of Information Science Nara Institute Of Science And Technology
-
Nakanishi Masaki
Nara Institute Of Technology
-
Kashiwabara Toshinobu
Department Of Bioinformatic Engineering Guraduate School Of Information Science And Technology Osaka
-
NAKANISHI MASAKI
Department of Chemistry and Biotechnology, Faculty of Engineering, The University of Tokyo
-
Yajima S
Kansai Univ.
-
Yajima Shuzo
Department Of Information Science Kyoto University
-
HIRAISHI HIROMI
Department of Information and Communication Sciences, Faculty of Engineering, Kyoto Sangyo Universit
-
FUJII HIROSHI
Information and Communication Processing Research Laboratory, NTT.
-
Nakanishi Masaki
Graduate School Of Information Science Nara Institute Of Science And Technology
-
INDOH Takao
Department of Informatics and Mathematical Science, Graduate School of Engineering Science, Osaka Un
-
Hiraishi Hiromi
Department Of Information And Communication Sciences Faculty Of Engineering Kyoto Sangyo University
-
Indoh Takao
Department Of Informatics And Mathematical Science Graduate School Of Engineering Science Osaka Univ
-
Yajima Shuzo
Department Of Information Science Facu1ty Of Engineering Kyoto University
-
Nakanishi Masaki
Department Of Chemistry And Biotechnology Faculty Of Engineering The University Of Tokyo
-
Fujii Hiroshi
Information And Communication Processing Research Laboratory Ntt.
-
Nakanishi Masaki
Department of Applied Chemistry, Nagoya Institute of Technology
著作論文
- Regular Temporal Logic Expressively Equivalent to Finite Automata and Its Application to Logic Design Verification
- Expressive Power of Quantum Pushdown Automata with Classical Stack Operations under the Perfect-Soundness Condition(Computation and Computational Models)
- On the Power of Non-deterministic Quantum Finite Automata(Special Issue on Selected Papers from LA Symposium)
- An Exponential Lower Bound on the Size of a Binary Moment Diagram Representing Integer Division (Special Section on Discrete Mathematics and Its Applications)