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
[1]
Hilfe
Suche: Author="Honda, N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dynamical characteristics of linear cellular automata
H. Aso
,
N. Honda
Journal of Computer and System Sciences
30
(3), 1985, June, pp. 291-317
A complete axiom system for algebra of closed-regular expression
H. Izumi
,
Y. Inagaki
,
N. Honda
Lecture Notes in Computer Science
172
, 1984, pp. 260-269
The firing squad synchronization problem for graphs
Y. Nishitani
,
N. Honda
Theoretical Computer Science
14
, 1981, pp. 39-61
The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine
M. Oyamaguchi
,
Y. Inagaki
,
N. Honda
Journal of Computer and System Sciences
23
(3), 1981, December, pp. 366-382
The star height of reset-free events and strictly locally testable events
K. Hashiguchi
,
N. Honda
Information and Control
40
, 1979, pp. 267-284
Certain relations between properties of maps of tessellation automata
T. Sato
,
N. Honda
Journal of Computer and System Sciences
15
(2), 1977, October, pp. 121-145
Properties of code events and homomorphisms over regular events
K. Hashiguchi
,
N. Honda
Journal of Computer and System Sciences
12
, 1976, pp. 352-367
Homomorphisms that preserve star height
K. Hashiguchi
,
N. Honda
Information and Control
30
, 1976, pp. 247-266