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="Oyamaguchi, Michio"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The reachability and related decision problems for monadic and semi-constructor TRSs
Ichiro Mitsuhashi
,
Michio Oyamaguchi
,
Toshiyuki Yamada
Information Processing Letters
98
(6), 2006, pp. 219-224
The unification problem for confluent right-ground term rewriting systems
Michio Oyamaguchi
,
Yoshikatsu Ohta
Information and Computation
183
(2), 2003, pp. 187-211
NV-sequentiality: A decidable condition for call-by-need computations in term-rewriting systems
Michio Oyamaguchi
SIAM Journal on Computing
22
(1), 1993, February, pp. 114-135
The equivalence problem for real-time DPDAs
Michio Oyamaguchi
Journal of the ACM
34
(3), 1987, July, pp. 731-760
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