Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Honda, Namio"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The equivalence problem for real-time strict deterministic languages
MIchio Oyamaguchi
,
Namio Honda
,
Yasuyoshi Inagaki
Information and Control
45
, 1980, pp. 90-115
A simplicity test for deterministic pushdown automata
Michio Oyamaguchi
,
Yasuyoshi Inagaki
,
Namio Honda
Information and Control
47
, 1980, pp. 10-36
A real-time strictness test for deterministic pushdown automata
Michio Oyamaguchi
,
Yasuyoshi Inagaki
,
Namio Honda
Information and Control
47
, 1980, pp. 1-9
The decidability of equivalence for deterministic stateless pushdown automata
Michio Oyamaguchi
,
Namio Honda
Information and Control
38
, 1978, pp. 367-376
A completeness property of one-dimensional tessellation automata
Masakazu Nasu
,
Namio Honda
Journal of Computer and System Sciences
12
, 1976, pp. 36-48
Deterministic multitape automata computations
Yoshihide Igarashi
,
Namio Honda
Journal of Computer and System Sciences
8
, 1974, pp. 167-189
On the extension of Gladkij's theorem and the hierarchies of languages
Yoshihide Igarashi
,
Namio Honda
Journal of Computer and System Sciences
7
, 1973, pp. 199-217
A context-free language which is not acceptable by a probabilistic automaton
Masakazu Nasu
,
Namio Honda
Information and Control
18
, 1971, pp. 233-236
Mappings induced by PGSM-mappings and some recursively unsolvable problems of probabilistic automata
Masakazu Nasu
,
Namio Honda
Information and Control
15
, 1969, pp. 250-273
Fuzzy events realized by finite probabilistic automata
Masakazu Nasu
,
Namio Honda
Information and Control
12
, 1968, pp. 284-303