Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Namio Honda

dblp:23/2566 · DBLP profile ↗
← Back
24ranked-venue papers
0as first author
0since 2021 · last 1989
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 19Artificial intelligence and machine learning · 2Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
13 papers
Automata and formal languages · 58% Logic in computer science · 29% Computational complexity · 12%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

Topics — the 19 heaviest of 22, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages
pushdown automata
0.031980
A Simplicity Test for Deterministic Pushdown Automata · Inf. Control. 1980
A Real-Time Strictness Test for Deterministic Pushdown Automata · Inf. Control. 1980
The Decidability of Equivalence for Determistic Stateless Pushdown Automata · Inf. Control. 1978
Automata and formal languages › pushdown automata
deterministic pushdown automata
0.021980
A Simplicity Test for Deterministic Pushdown Automata · Inf. Control. 1980
A Real-Time Strictness Test for Deterministic Pushdown Automata · Inf. Control. 1980
Logic in computer science › meta-logic
axiomatization
0.011984
A Complete Axiom System for Algebra of Closed-Regular Expression · ICALP 1984
Logic in computer science
completeness
0.011984
A Complete Axiom System for Algebra of Closed-Regular Expression · ICALP 1984
Computational complexity
decidability
0.021980
The Equivalence Problem for Real-Time Strict Deterministic Languages · Inf. Control. 1980
The Decidability of Equivalence for Determistic Stateless Pushdown Automata · Inf. Control. 1978
Automata and formal languages
equivalence problem
0.021980
The Equivalence Problem for Real-Time Strict Deterministic Languages · Inf. Control. 1980
The Decidability of Equivalence for Determistic Stateless Pushdown Automata · Inf. Control. 1978
Automata and formal languages
regular languages
0.021979
The Star Height of Reset-Free Events and Strictly Locally Testable Events · Inf. Control. 1979
Homomorphisms That Preserve Star Height · Inf. Control. 1976
Automata and formal languages › regular languages
star height
0.021979
The Star Height of Reset-Free Events and Strictly Locally Testable Events · Inf. Control. 1979
Homomorphisms That Preserve Star Height · Inf. Control. 1976
Programming languages and type systems
abstract data types
0.011982
Specification of Abstract Data Types with Partially Defined Operations · ICSE 1982
Programming languages and type systems
type theory
0.011982
Specification of Abstract Data Types with Partially Defined Operations · ICSE 1982
Logic in computer science › universal algebra
partial algebra
0.011982
Specification of Abstract Data Types with Partially Defined Operations · ICSE 1982
Logic in computer science
semantics
0.011982
Specification of Abstract Data Types with Partially Defined Operations · ICSE 1982
Automata and formal languages › context-free languages
deterministic context-free languages
0.011980
The Equivalence Problem for Real-Time Strict Deterministic Languages · Inf. Control. 1980
Logic in computer science
many-valued logic
0.021975
The Range of Logical Flexibility of Tree Networks · IEEE Trans. Computers 1975
Logical Networks of Flexible Cells · IEEE Trans. Computers 1973
Automata and formal languages
probabilistic automata
0.031971
A Context-Free Language Which is not Acceptable by a Probabilistic Automaton · Inf. Control. 1971
Mappings Induced by PGSM-Mappings and Some Recursively Unsolvable Problems of Finite Probabilistic Automata · Inf. Control. 1969
Fuzzy Events Realized by Finite Probabilistic Automata · Inf. Control. 1968
Electronic design automation
logic synthesis
0.021975
The Range of Logical Flexibility of Tree Networks · IEEE Trans. Computers 1975
Logical Networks of Flexible Cells · IEEE Trans. Computers 1973
Computational complexity
undecidability
0.011969
Mappings Induced by PGSM-Mappings and Some Recursively Unsolvable Problems of Finite Probabilistic Automata · Inf. Control. 1969
Interconnection networks and networks-on-chip › network topology
tree networks
0.011975
The Range of Logical Flexibility of Tree Networks · IEEE Trans. Computers 1975
Automata and formal languages › formal language operations
morphisms
0.011976
Homomorphisms That Preserve Star Height · Inf. Control. 1976

Methods — techniques the papers use, named apart from their topics

automata theory · 0.0algebraic specification · 0.0axiomatic method · 0.0combinatorial methods · 0.0algebraic methods · 0.0
YearPublicationVenuePosition
1989 Representation of Iterative Patterns
abstract
Iterative patterns can be described by the component pattern of iteration and their way of connection for iteration. It is shown that the shape of the component pattern can be a rectangle for any iterative pattern, which is called a tile. The tile is related to the basis of the parallel translation group of the iterative pattern. The component pattern itself is identified by a "tessera" which is defined by a non-degenerate colored tile. The tessera is a compact representation of iterative patterns. Some natures of tesseras and tiles are also discussed. The number of the kinds of distinct iterative patterns for each way of iteration is evaluated.
Hiromoto Aso, Namio Honda
Int. J. Pattern Recognit. Artif. Intell.2
1985 Dynamical Characteristics of Linear Cellular Automata
Hirotomo Aso, Namio Honda
J. Comput. Syst. Sci.2
1984 A Complete Axiom System for Algebra of Closed-Regular Expression
Hiroyuki Izumi, Yasuyoshi Inagaki, Namio Honda
ICALP3
1984 Distance functions defined by variable neighborhood sequences
Masafumi Yamashita, Namio Honda
Pattern Recognit.2
1982 Specification of Abstract Data Types with Partially Defined Operations
Toshiki Sakabe, Yasuyoshi Inagaki, Namio Honda
ICSE3
1981 The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine
Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
J. Comput. Syst. Sci.3
1981 The Firing Squad Synchronization Problem for Graphs
Yasuaki Nishitani, Namio Honda
Theor. Comput. Sci.2
1980 The Equivalence Problem for Real-Time Strict Deterministic Languages
Michio Oyamaguchi, Namio Honda
Inf. Control.2
1980 A Real-Time Strictness Test for Deterministic Pushdown Automata
Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
Inf. Control.3
1980 A Simplicity Test for Deterministic Pushdown Automata
Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda
Inf. Control.3
1979 The Star Height of Reset-Free Events and Strictly Locally Testable Events
Kosaburo Hashiguchi, Namio Honda
Inf. Control.2
1978 The Decidability of Equivalence for Determistic Stateless Pushdown Automata
Michio Oyamaguchi, Namio Honda
Inf. Control.2
1977 Certain Relations between Properties of Maps of Tessellation Automata
Tadakazu Sato, Namio Honda
J. Comput. Syst. Sci.2
1976 Homomorphisms That Preserve Star Height
Kosaburo Hashiguchi, Namio Honda
Inf. Control.2
1976 Properties of Code Events and Homomorphisms over Regular Events
Kosaburo Hashiguchi, Namio Honda
J. Comput. Syst. Sci.2
1976 A Completeness Property of One-Dimensional Tessellation Automata
Masakazu Nasu, Namio Honda
J. Comput. Syst. Sci.2
1975 Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages
Yoshihide Igarashi, Namio Honda
J. Comput. Syst. Sci.2
1975 The Range of Logical Flexibility of Tree Networks
abstract
The flexible network is a network composed of flexible logical multivalued cells which can be adjusted at will to perform any functions. The network is assumed to have a fixed interconnection pattern and to have a fixed-input variable assignment. We have already investigated the necessary and sufficient range of flexibility of the cell's function to obtain all the output functions the network could realize. Let the network be composed of p cells and let the necesary and sufficient flexibility range of the 1th cell be denoted by φζ for ζ = 1,...,p It is shown that although the range of flexibility of the whole network φ1X ... X φpis sufficient for the network, as a whole, to produce all the output functions the network could realize, the above range is not necessary in general. Finally we derive a sufficient condition for the proposition that the range of logical flexibility of the network, φ1X ...φp, is critical. This gives a relationship between the range of logical flexibility obtained by considering a cell in the network and the one obtained by considering the whole network.
Akira Maruoka, Namio Honda
IEEE Trans. Computers2
1974 Deterministic Multitape Automata Computations
Yoshihide Igarashi, Namio Honda
J. Comput. Syst. Sci.2
1973 On the Extension of Gladkij's Theorem and the Hierarchies of Languages
Yoshihide Igarashi, Namio Honda
J. Comput. Syst. Sci.2
1973 Logical Networks of Flexible Cells
abstract
The flexible network is a network composed of flexible logical multivalued cells that can be adjusted at will to perform any functions. The network is assumed to have a fixed-interconnection pattern and to have a fixed-input variable assignment. The following question is answered. What is the necessary and sufficient range of the flexibility of the cells' functions to obtain all the output functions the circuit could realize? Furthermore, the relation between the cells functions that realize the same output functions is derived and the number of different realizable output functions is counted.
Akira Maruoka, Namio Honda
IEEE Trans. Computers2
1971 A Context-Free Language Which is not Acceptable by a Probabilistic Automaton
Masakazu Nasu, Namio Honda
Inf. Control.2
1969 Mappings Induced by PGSM-Mappings and Some Recursively Unsolvable Problems of Finite Probabilistic Automata
Masakazu Nasu, Namio Honda
Inf. Control.2
1968 Fuzzy Events Realized by Finite Probabilistic Automata
Masakazu Nasu, Namio Honda
Inf. Control.2