Morita K | Hiroshima Univ. Higashi‐hiroshima‐shi Jpn
スポンサーリンク
概要
関連著者
-
Morita K
Hiroshima Univ. Higashi‐hiroshima‐shi Jpn
-
Morita Kenichi
Hiroshima Univ. Higashihiroshima‐shi Jpn
-
IWAMOTO Chuzo
Graduate School of Engineering, Hiroshima University
-
MORITA Kenichi
Graduate School of Engineering, Hiroshima University
-
IMAI Katsunobu
Graduate School of Engineering, Hiroshima University
-
Iwamoto Chuzo
Hiroshima Univ. Higashihiroshima‐shi Jpn
-
Iwamoto Chuzo
Graduate School Of Engineering Hiroshima University
-
Morita Kenichi
Graduate School Of Engineering Hiroshima University
-
Imai K
Graduate School Of Engineering Hiroshima University
-
Imai Katsunobu
Graduate School Of Engineering Hiroshima University
-
Morita Kenichi
The Authors Are With The Faculty Of Engineering Hiroshima University
-
LEE Jia
The authors are with the Faculty of Engineering, Hiroshima University
-
Lee Jia
The Authors Are With The Faculty Of Engineering Hiroshima University
-
YONEDA Harumasa
Graduate School of Engineering, Hiroshima University
-
TANIMOTO Naonori
Graduate School of Engineering, Hiroshima University
-
YOKOUCHI Tomoka
Graduate School of Engineering, Hiroshima University
-
IKAZAKI Akihiko
Graduate School of Engineering, Hiroshima University
-
Yokouchi Tomoka
Graduate School Of Engineering Hiroshima University:(present Address)panasonic Msb.
-
Ikazaki Akihiko
Graduate School Of Engineering Hiroshima University
-
Yoneda Harumasa
Graduate School Of Engineering Hiroshima University
-
Tanimoto Naonori
Graduate School Of Engineering Hiroshima University
著作論文
- Uniquely Parallel Parsable Unification Grammars (Special lssue on Selected Papers from LA Synposium)
- Normal Forms for Uniquely Parsable Grammar Classes Forming the Deterministic Chomsky Hierarchy
- On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than Four
- A Recursive Padding Technique on Nondeterministic Cellular Automata
- Prefix Computations on Iterative Arrays with Sequential Input/Output Mode(Cellular Automata)
- A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function(Cellular Automata)