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="Hashiguchi, K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language
K. Hashiguchi
Lecture Notes in Computer Science
510
, 1991, pp. 641-648
Notes on finitely generated semigroups and pumping conditions for regular languages
K. Hashiguchi
Theoretical Computer Science
46
(1), 1986, pp. 53-66
Representation theorems on regular languages
K. Hashiguchi
Journal of Computer and System Sciences
27
(1), 1983, August, pp. 101-115
Limitedness theorem on finite automata with distance functions
K. Hashiguchi
Journal of Computer and System Sciences
24
(2), 1982, April, pp. 233-244
Regular Languages of Star Height One
K. Hashiguchi
Information and Control
53
(3), 1982, pp. 199-210
The star height of reset-free events and strictly locally testable events
K. Hashiguchi
,
N. Honda
Information and Control
40
, 1979, pp. 267-284
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