Books

1. M.Oyamaguchi and H.Gomi:
   "Programming Languages",
   Corona Publishing Co., 2008
2. M.Oyamaguchi:
   "Algorithm Dictionary",
   Kyoritsu Shuppan Co. Ltd., pp.691-693, 1994
3. M.Oyamaguchi:
   "Theory of Compiler Design",
   Corona Publishing Co., 1989

Papers

1. I.Mitsuhashi, M.Oyamaguchi, F.Jacquemard:
   "The Confluence Problem for Flat TRSs",
   Proceedings of the 8th International Conference on Artificial Intelligence and Symbolic Computation (AISC 2006), Lecture Notes in Artificial Intelligence 4120, pp.68-81, 2006
2. I.Mitsuhashi, M.Oyamaguchi, Y.Ohta, T.Yamada:
   "The Joinability and Related Decision Problems for Semi-constructor TRSs",
   Trans. IPSJ, Vol.47, No.5, pp.1502-1514, 2006
3. I.Mitsuhashi, M.Oyamaguchi, T.Yamada:
   "The Reachability and Related Decision Problems for Monadic and Semi-Constructor TRSs",
   Information Processing Letters, Vol.98, pp.219-224, 2006
4. I.Mitsuhashi, M.Oyamaguchi, Y.Ohta, T.Yamada:
   "The Joinability and Unification Problems for Confluent Semi-Constructor TRSs",
   Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA 2004), Lecture Notes in Computer Science 3091, pp.285-300, 2004
5. M.Oyamaguchi, Y.Ohta:
   "On the Open Problems Concerning Church-Rosser of Left-Linear Term Rewriting Systems",
   Trans. of IEICE, Inf.& Syst., Vol.E87-D, No.2, pp.290-298, 2004
6. M.Oyamaguchi, Y.Ohta:
   "The unification problem for confluent right-ground term rewriting systems",
   Information and Computation, Vol.183, No.2, pp.187-211, 2003
7. I.Mitsuhashi, M.Oyamaguchi, Y.Ohta, T.Yamada:
   "On the Unification Problem for Confluent Monadic Term Rewriting Systems",
   Trans. of IPSJ, Vol.44, No.SIG 4(PRO 17), pp.54-66, 2003
8. M.Oyamaguchi, Y.Ohta:
   "On the Church-Rosser Property of Left-Linear Term Rewriting Systems",
   Trans. of IEICE, Vol.E86-D, No.1, pp.131-135, 2003
9. T.Kawata, M.Oyamaguchi, Y.Ohta:
   "On the Task Scheduling with Communication Delay (In Japanese)",
   Trans. of IEICE, Vol.J85-D-I, No.11, pp.1088-1092, 2002
10. M.Oyamaguchi, Y.Ohta:
    "The Unification Problem for Confluent Right-Ground Term Rewriting Systems",
    in A.Middeldorp(Ed.), "RTA-2001 Rewriting Techniques and Applications", LNCS 2051, pp.246-260, 2001
11. Y.Toyama, M.Oyamaguchi:
    "Conditional Linearization of Non-Duplicating Term Rewriting Systems",
    Trans. of IEICE, Vol.E84-D, No.4, pp.439-447, 2001
12. Y.Matsubara, M.Oyamaguchi, Y.Ohta:
    "Code Scheduling for Multi-Processor Systems (In Japanese)",
    Trans. of IEICE, Vol.J82-D-I, No.10, pp.1232-1244, 1999
13. H.Gomi, M.Oyamaguchi, Y.Ohta:
    "On the Church-Rosser Property of Root-E-overlapping and Strongly Depth-preserving Term Rewriting Systems",
    Trans. IPS. Japan, Vol.39, No.4, pp.992-1005, 1998
14. Y.Matsubara, T.Hattori, M.Oyamaguchi, Y.Ohta:
    "Code Scheduling for Instruction-Level Parallel Processors (In Japanese)",
    Trans. of IEICE, Vol.J80-D-I, No.12, pp.971-974, 1997
15. K.Matsuura, M.Oyamaguchi, Y.Ohta, M.Ogawa:
    "On the E-Overlapping Property of Nonlinear Term Rewriting Systems (In Japanese)",
    Trans. of IEICE, Vol.J80-D-I, No.11, pp.847-855, 1997
16. M.Oyamaguchi, Y.Ohta:
    "A New Parallel Closed Condition for Church-Rosser of Left-Linear Term Rewriting Systems",
    in H.Comon(Ed.), "RTA-97 Rewriting Techniques and Applications", LNCS 1232, pp.187-201, 1997
17. H.Gomi, M.Oyamaguchi, Y.Ohta:
    "On the Church-Rosser Property of Non-E-overlapping and Depth-Preserving TRS's",
    Trans. of IPSJ, Vol.37, No.12, pp.2147-2160, 1996.
18. Y.Ohta, M.Oyamaguchi, Y.Toyama:
    "On the Church-Rosser Property of Simple-Right-Linear TRS's",
    Trans. of IEICE, Vol.J78-D-I, No.3, pp.263-268, 1995
19. Y.Toyama, M.Oyamaguchi:
    "Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems",
    Proc. 4th International Workshop on Conditional and Typed Rewriting Systems, LNCS 968 (Springer), pp.316-331, 1995
20. M.Oyamaguchi:
    "NV-Sequentiality: a Decidable Condition for Call-by-Need Computations in Term Rewriting Systems",
    SIAM Journal on Computing, Vol.22, No.1, pp.114-135, 1993
21. M.Oyamaguchi, Y.Ohta:
    "On the Confluent Property of Right-Ground Term Rewriting Systems (In Japanese)",
    Trans. of IEICE, Vol. J76-D-I, No.2, pp.39-45, 1993
22. M.Oyamaguchi:
    "The Reachability and Joinability Problems for Right-Ground Term-Rewriting Systems",
    Journal of Information Processing, Vol.13, No.3, pp.347-354, 1990
23. M.Oyamaguchi:
    "On the Word Problem for Right-Ground Term-Rewriting Systems",
    The Transaction of the IEICE, Vol.E73, No.5, pp.718-723, 1990
24. M.Oyamaguchi:
    "The Equivalence Problem for Real-Time DPDAs",
    Journal of the Association for Computing Machinery, Vol.34, No.3, pp.731-760, 1987
25. M.Oyamaguchi:
    "The Church-Rosser Property for Ground Term-Rewriting Systems Is Decidable",
    Theoretical Computer Science, Vol.49, No.1, pp.43-79, 1987
26. M.Oyamaguchi:
    "The Reachability Problem for Quasi-Ground Term Rewriting Systems",
    Journal of Information Processing, Vol.9, No.4, pp.232-236, 1986
27. M.Oyamaguchi:
    "On the Data Type Extension Problem for Algebraic Specifications",
    Theoretical Computer Science, Vol.35, No.(2,3), pp.329-336, 1985
28. M.Oyamaguchi:
    "Some remarks on subclass containment problems for several classes of dpda's",
    Information Processing Letters, North-Holland, Vol.19, No.1, pp.232-236, 1984
29. M.Oyamaguchi:
    "Some results on subclass containment problems for special classes of dpda's related to nonsingular machines",
    Theoretical Computer Science, Vol.31, No.3, pp.317-335, 1984
30. M.Oyamaguchi:
    "Relation between Abstract and Concrete Implementations of Algebraic Specifications",
    Information Processing 83 (Proceedings of the 9th World Computer Congress, North-Holland), pp.407-412, 1983
31. T.Kawarabayashi, Y.Ohta, M.Oyamaguchi, Y.Inagaki:
    "A Software Validation System Based on Algebraic Specification",
    Trans. of IECE, Vol.J66-D, No.6, 1983
32. M.Oyamaguchi, Y.Inagaki, N.Honda:
    "The Equivalence Problem for Two dpda's, One of Which is a Finite-Turn or One-Counter Machine",
    Journal of Computer and System Sciences, Vol.23, No.3, pp.366-382, 1981
33. M.Oyamaguchi, Y.Inagaki, N.Honda:
    "A Simplicity Test for Deterministic Pushdown Automata",
    Information and Control, Vol.47, No.1, pp.10-36, 1980
34. M.Oyamaguchi, Y.Inagaki, N.Honda:
    "A Real-time Strictness Test for Deterministic Pushdown Automata",
    Information and Control, Vol.47, No.1, pp.1-9, 1980
35. M.Oyamaguchi, Y.Inagaki, N.Honda:
    "On the equivalence problem for two dpda's, one of which is real-time",
    Information Processing 80 (Proceedings of the 8th World Computer Congress, North-Holland), pp.53-57, 1980
36. M.Oyamaguchi:
    "Some Results on Equivalence and Subclass Containment Problems for DPDA's",
    Proceedings of the 5th IBM Symposium on MFCS, pp.1-35, 1980
37. M.Oyamaguchi, N.Honda, Y.Inagaki:
    "The Equivalence Problem for Real-time Strict Deterministic Languages",
    Information and Control, Vol.45, No.1, pp.90-115, 1980
38. M.Oyamaguchi, Y.Inagaki, N.Honda:
    "The decidability of equivalence for real-time strict deterministic languages and the simplicity problem for deterministic pushdown automata",
    Formal Language Theory Symposium, Santa Barbara, 1979
39. M.Oyamaguchi, N.Honda:
    "The Decidability of Equivalence for Deterministic Stateless Pushdown Automata",
    Information and Control, Vol.38, No.3, pp.367-376, 1978