default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNamio Honda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1989
[j24]Hiromoto Aso, Namio Honda:
Representation of Iterative Patterns. Int. J. Pattern Recognit. Artif. Intell. 3(3-4): 479-496 (1989)- [p1]Hirotomo Aso, Namio Honda:
Representation of iterative Patterns. Array Grammars, Patterns and Recognizers 1989: 201-218 - 1987
- [j23]Tohru Naoi, Masafumi Yamashita, Toshihide Ibaraki, Namio Honda:
A class of ambiguous linear term-rewriting systems on which call-by-need is a normalizing reduction strategy. Syst. Comput. Jpn. 18(9): 19-30 (1987) - 1986
- [j22]Masanari Arai, Masafumi Yamashita, Tomio Hirata, Toshihide Ibaraki, Namio Honda:
Lower bounds on time complexity for some subgraph detection problems. Syst. Comput. Jpn. 17(6): 95-102 (1986) - 1985
- [j21]Hirotomo Aso, Namio Honda:
Dynamical Characteristics of Linear Cellular Automata. J. Comput. Syst. Sci. 30(3): 291-317 (1985) - 1984
- [j20]Masafumi Yamashita, Namio Honda:
Distance functions defined by variable neighborhood sequences. Pattern Recognit. 17(5): 509-513 (1984) - [c3]Hiroyuki Izumi, Yasuyoshi Inagaki, Namio Honda:
A Complete Axiom System for Algebra of Closed-Regular Expression. ICALP 1984: 260-269 - 1982
- [c2]Toshiki Sakabe, Yasuyoshi Inagaki, Namio Honda:
Specification of Abstract Data Types with Partially Defined Operations. ICSE 1982: 218-224 - 1981
- [j19]Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda:
The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine. J. Comput. Syst. Sci. 23(3): 366-382 (1981) - [j18]Yasuaki Nishitani, Namio Honda:
The Firing Squad Synchronization Problem for Graphs. Theor. Comput. Sci. 14: 39-61 (1981) - 1980
- [j17]Michio Oyamaguchi, Namio Honda:
The Equivalence Problem for Real-Time Strict Deterministic Languages. Inf. Control. 45(1): 90-115 (1980) - [j16]Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda:
A Real-Time Strictness Test for Deterministic Pushdown Automata. Inf. Control. 47(1): 1-9 (1980) - [j15]Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda:
A Simplicity Test for Deterministic Pushdown Automata. Inf. Control. 47(1): 10-36 (1980) - [c1]Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda:
On the Equivalence Problem for Two DPDA's, One of which is Real-Time. IFIP Congress 1980: 53-58
1970 – 1979
- 1979
- [j14]Kosaburo Hashiguchi, Namio Honda:
The Star Height of Reset-Free Events and Strictly Locally Testable Events. Inf. Control. 40(3): 267-284 (1979) - 1978
- [j13]Michio Oyamaguchi, Namio Honda:
The Decidability of Equivalence for Determistic Stateless Pushdown Automata. Inf. Control. 38(3): 367-376 (1978) - 1977
- [j12]Tadakazu Sato, Namio Honda:
Certain Relations between Properties of Maps of Tessellation Automata. J. Comput. Syst. Sci. 15(2): 121-145 (1977) - 1976
- [j11]Kosaburo Hashiguchi, Namio Honda:
Homomorphisms That Preserve Star Height. Inf. Control. 30(3): 247-266 (1976) - [j10]Masakazu Nasu, Namio Honda:
A Completeness Property of One-Dimensional Tessellation Automata. J. Comput. Syst. Sci. 12(1): 36-48 (1976) - [j9]Kosaburo Hashiguchi, Namio Honda:
Properties of Code Events and Homomorphisms over Regular Events. J. Comput. Syst. Sci. 12(3): 352-367 (1976) - 1975
- [j8]Yoshihide Igarashi, Namio Honda:
Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages. J. Comput. Syst. Sci. 11(3): 397 (1975) - [j7]Akira Maruoka, Namio Honda:
The Range of Logical Flexibility of Tree Networks. IEEE Trans. Computers 24(1): 9-28 (1975) - 1974
- [j6]Yoshihide Igarashi, Namio Honda:
Deterministic Multitape Automata Computations. J. Comput. Syst. Sci. 8(2): 167-189 (1974) - 1973
- [j5]Yoshihide Igarashi, Namio Honda:
On the Extension of Gladkij's Theorem and the Hierarchies of Languages. J. Comput. Syst. Sci. 7(2): 199-217 (1973) - [j4]Akira Maruoka, Namio Honda:
Logical Networks of Flexible Cells. IEEE Trans. Computers 22(4): 347-358 (1973) - 1971
- [j3]Masakazu Nasu, Namio Honda:
A Context-Free Language Which is not Acceptable by a Probabilistic Automaton. Inf. Control. 18(3): 233-236 (1971)
1960 – 1969
- 1969
- [j2]Masakazu Nasu, Namio Honda:
Mappings Induced by PGSM-Mappings and Some Recursively Unsolvable Problems of Finite Probabilistic Automata. Inf. Control. 15(3): 250-273 (1969) - 1968
- [j1]Masakazu Nasu, Namio Honda:
Fuzzy Events Realized by Finite Probabilistic Automata. Inf. Control. 12(4): 284-303 (1968)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
