Yasuo Kawahara

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Shuichi Inokuchi

> Home > Persons > Yasuo Kawahara

Publications

2016
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/ieicet/InokuchiFIK16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/InokuchiFIK16
Shuichi Inokuchi, Hitoshi Furusawa, Toshikazu Ishida, Yasuo Kawahara:
Cellular Automata Associated with Σ-Algebras. IEICE Trans. Inf. Syst. 99-D(3): 588-597 (2016)
[j10]
- view
  - electronic edition @ oldcitypublishing.com
  - no references & citations available
- export record
  dblp key:
  - journals/jca/IshidaIK16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jca/IshidaIK16
Toshikazu Ishida, Shuichi Inokuchi, Yasuo Kawahara:
Propositional Logic and Cellular Automata on Monoids. J. Cell. Autom. 12(1-2): 27-45 (2016)
2014
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/acri/IshidaIK14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acri/IshidaIK14
Toshikazu Ishida, Shuichi Inokuchi, Yasuo Kawahara:
Cellular Automata and Formulae on Monoids. ACRI 2014: 55-64
2005
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/uc/InokuchiHLSMK05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/uc/InokuchiHLSMK05
Shuichi Inokuchi, Kazumasa Honda, Hyen Yeal Lee, Tatsuro Sato, Yoshihiro Mizoguchi, Yasuo Kawahara:
On Reversible Cellular Automata with Finite Cell Array. UC 2005: 130-141

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.