Namio Honda

Proceedings of the Array Grammars, Patterns and Recognizers, 1989

Representation of Iterative Patterns.

[BibT_eX]

[DOI]

Hiromoto Aso

Int. J. Pattern Recognit. Artif. Intell., 1989

1987

A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1987

1986

Lower bounds on time complexity for some subgraph detection problems.

[BibT_eX]

[DOI]

Syst. Comput. Jpn., 1986

1985

Dynamical Characteristics of Linear Cellular Automata.

[BibT_eX]

[DOI]

Hirotomo Aso

J. Comput. Syst. Sci., 1985

1984

Distance functions defined by variable neighborhood sequences.

[BibT_eX]

[DOI]

Masafumi Yamashita

Pattern Recognit., 1984

A Complete Axiom System for Algebra of Closed-Regular Expression.

[BibT_eX]

[DOI]

Hiroyuki Izumi

Proceedings of the Automata, 1984

1982

Specification of Abstract Data Types with Partially Defined Operations.

[BibT_eX]

[DOI]

Toshiki Sakabe

Proceedings of the Proceedings, 1982

1981

The Firing Squad Synchronization Problem for Graphs.

[BibT_eX]

[DOI]

Yasuaki Nishitani

Theor. Comput. Sci., 1981

The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1981

1980

A Simplicity Test for Deterministic Pushdown Automata

[BibT_eX]

[DOI]

Inf. Control., October, 1980

A Real-Time Strictness Test for Deterministic Pushdown Automata

[BibT_eX]

[DOI]

Inf. Control., October, 1980

The Equivalence Problem for Real-Time Strict Deterministic Languages

[BibT_eX]

[DOI]

Inf. Control., April, 1980

On the Equivalence Problem for Two DPDA's, One of which is Real-Time.

[BibT_eX]

Proceedings of the Information Processing, Proceedings of the 8th IFIP Congress 1980, Tokyo, Japan - October 6-9, 1980 and Melbourne, Australia, 1980

1979

The Star Height of Reset-Free Events and Strictly Locally Testable Events

[BibT_eX]

[DOI]

Kosaburo Hashiguchi

Inf. Control., March, 1979

1978

The Decidability of Equivalence for Determistic Stateless Pushdown Automata

[BibT_eX]

[DOI]

Inf. Control., September, 1978

1977

Certain Relations between Properties of Maps of Tessellation Automata.

[BibT_eX]

[DOI]

Tadakazu Sato

J. Comput. Syst. Sci., 1977

1976

Homomorphisms That Preserve Star Height

[BibT_eX]

[DOI]

Kosaburo Hashiguchi

Inf. Control., March, 1976

A Completeness Property of One-Dimensional Tessellation Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1976

Properties of Code Events and Homomorphisms over Regular Events.

[BibT_eX]

[DOI]

Kosaburo Hashiguchi

J. Comput. Syst. Sci., 1976

1975

The Range of Logical Flexibility of Tree Networks.

[BibT_eX]

[DOI]

Akira Maruoka

IEEE Trans. Computers, 1975

Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages.

[BibT_eX]

Yoshihide Igarashi

J. Comput. Syst. Sci., 1975

1974

Deterministic Multitape Automata Computations.

[BibT_eX]

[DOI]

Yoshihide Igarashi

J. Comput. Syst. Sci., 1974

1973

Logical Networks of Flexible Cells.

[BibT_eX]

[DOI]

Akira Maruoka

IEEE Trans. Computers, 1973

On the Extension of Gladkij's Theorem and the Hierarchies of Languages.

[BibT_eX]

[DOI]

Yoshihide Igarashi

J. Comput. Syst. Sci., 1973

1971

A Context-Free Language Which is not Acceptable by a Probabilistic Automaton

[BibT_eX]

[DOI]

Inf. Control., April, 1971

1969

Mappings Induced by PGSM-Mappings and Some Recursively Unsolvable Problems of Finite Probabilistic Automata

[BibT_eX]

[DOI]

Inf. Control., September, 1969

1968

Fuzzy Events Realized by Finite Probabilistic Automata

[BibT_eX]

[DOI]