Katsuhiko Nakamura

27 papers A* 1B 4C 3Journal 11Unranked 7
YearRankTypeTitle / Venue / Authors
2013 C conf
Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars.
LATA
Katsuhiko Nakamura, Keita Imada
2011 — conf
Towards Incremental Learning of Mildly Context-Sensitive Grammars.
ICMLA (1)
Katsuhiko Nakamura, Keita Imada
2010 C conf
Asynchronous Parallel Self-Replication Based on Logic Molecular Model.
ALIFE
Katsuhiko Nakamura
2010 B conf
Incremental Learning of Cellular Automata for Parallel Recognition of Formal Languages.
Discovery Science
Katsuhiko Nakamura, Keita Imada
2010 J jnl
Search for Minimal and Semi-Minimal Rule Sets in Incremental Learning of Context-Free and Definite Clause Grammars.
IEICE Trans. Inf. Syst.
Keita Imada, Katsuhiko Nakamura
2009 J jnl
Erratum to "Languages not recognizable in real time by one-dimensional cellular automata" [J. Comput. System Sci 74 (7) (2008) 1095-1102].
J. Comput. Syst. Sci.
Katsuhiko Nakamura
2009 C conf
Learning Context Free Grammars by Using SAT Solvers.
ICMLA
Keita Imada, Katsuhiko Nakamura
2009 J jnl
Towards a Basis for Parallel Language Recognition by Cellular Automata.
J. Cell. Autom.
Katsuhiko Nakamura
2008 J jnl
Languages not recognizable in real time by one-dimensional cellular automata.
J. Comput. Syst. Sci.
Katsuhiko Nakamura
2008 — conf
Towards Machine Learning of Grammars and Compilers of Programming Languages.
ECML/PKDD (2)
Keita Imada, Katsuhiko Nakamura
2006 — conf
Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets.
ICGI
Katsuhiko Nakamura
2005 J jnl
Incremental learning of context free grammars based on bottom-up parsing and search.
Pattern Recognit.
Katsuhiko Nakamura, Masashi Matsumoto
2005 J jnl
Real-Time Recognition of Cyclic Strings by One-Way and Two-Way Cellular Automata.
IEICE Trans. Inf. Syst.
Katsuhiko Nakamura
2005 J jnl
Static analysis based on formal models and incremental computation in Go programming.
Theor. Comput. Sci.
Katsuhiko Nakamura
2004 — conf
Extending Incremental Learning of Context Free Grammars in Synapse.
ICGI
Katsuhiko Nakamura
2003 — conf
Incremental Learning of Context Free Grammars by Extended Inductive CYK Algorithm.
ECML Workshop on Learning Contex-Free Grammars
Katsuhiko Nakamura
2002 — conf
Incremental Learning of Context Free Grammars.
ICGI
Katsuhiko Nakamura, Masashi Matsumoto
2000 A* conf
Instantaneous Evaluation of Friction Based on ARTC Tactile Sensor.
ICRA
Hiroyuki Shinoda, Shinya Sasaki, Katsuhiko Nakamura
2000 — conf
Synthesizing Context Free Grammars from Sample Strings Based on Inductive CYK Algorithm.
ICGI
Katsuhiko Nakamura, Takashi Ishiwata
1999 B conf
Real-Time Language Recognition by One-Way and Two-Way Cellular Automata.
MFCS
Katsuhiko Nakamura
1991 J jnl
Logic hypergraph grammars and context-free hypergraph grammars.
Syst. Comput. Jpn.
Isamu Shioya, Katsuhiko Nakamura
1990 J jnl
AI: A Strategie Technology in Japan?
AI Soc.
Fumihiko Satofuka, Katsuhiko Nakamura
1986 B conf
Control of Logic Program Execution Based on the Functional Relations.
ICLP
Katsuhiko Nakamura
1984 B conf
Associative Concurrent Evaluation of Logic Programs.
ICLP
Katsuhiko Nakamura
1984 J jnl
Associative Concurrent Evaluation of Logic Programs.
J. Log. Program.
Katsuhiko Nakamura
1984 — ch.
Associative Evaluation of Prolog Programs.
Implementations of Prolog
Katsuhiko Nakamura
1981 J jnl
Synchronous to Asynchronous Transformation of Polyautomata.
J. Comput. Syst. Sci.
Katsuhiko Nakamura