Namio Honda

According to our database1, Namio Honda authored at least 28 papers between 1968 and 1989.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1989
Representation of iterative Patterns.
Proceedings of the Array Grammars, Patterns and Recognizers, 1989

Representation of Iterative Patterns.
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.
Syst. Comput. Jpn., 1987

1986
Lower bounds on time complexity for some subgraph detection problems.
Syst. Comput. Jpn., 1986

1985
Dynamical Characteristics of Linear Cellular Automata.
J. Comput. Syst. Sci., 1985

1984
Distance functions defined by variable neighborhood sequences.
Pattern Recognit., 1984

A Complete Axiom System for Algebra of Closed-Regular Expression.
Proceedings of the Automata, 1984

1982
Specification of Abstract Data Types with Partially Defined Operations.
Proceedings of the Proceedings, 1982

1981
The Firing Squad Synchronization Problem for Graphs.
Theor. Comput. Sci., 1981

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

1980
A Simplicity Test for Deterministic Pushdown Automata
Inf. Control., October, 1980

A Real-Time Strictness Test for Deterministic Pushdown Automata
Inf. Control., October, 1980

The Equivalence Problem for Real-Time Strict Deterministic Languages
Inf. Control., April, 1980

On the Equivalence Problem for Two DPDA's, One of which is Real-Time.
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
Inf. Control., March, 1979

1978
The Decidability of Equivalence for Determistic Stateless Pushdown Automata
Inf. Control., September, 1978

1977
Certain Relations between Properties of Maps of Tessellation Automata.
J. Comput. Syst. Sci., 1977

1976
Homomorphisms That Preserve Star Height
Inf. Control., March, 1976

A Completeness Property of One-Dimensional Tessellation Automata.
J. Comput. Syst. Sci., 1976

Properties of Code Events and Homomorphisms over Regular Events.
J. Comput. Syst. Sci., 1976

1975
The Range of Logical Flexibility of Tree Networks.
IEEE Trans. Computers, 1975

Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages.
J. Comput. Syst. Sci., 1975

1974
Deterministic Multitape Automata Computations.
J. Comput. Syst. Sci., 1974

1973
Logical Networks of Flexible Cells.
IEEE Trans. Computers, 1973

On the Extension of Gladkij's Theorem and the Hierarchies of Languages.
J. Comput. Syst. Sci., 1973

1971
A Context-Free Language Which is not Acceptable by a Probabilistic Automaton
Inf. Control., April, 1971

1969
Mappings Induced by PGSM-Mappings and Some Recursively Unsolvable Problems of Finite Probabilistic Automata
Inf. Control., September, 1969

1968
Fuzzy Events Realized by Finite Probabilistic Automata
Inf. Control., April, 1968


  Loading...