default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichio Oyamaguchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j17]Sayaka Ishizuki, Michio Oyamaguchi, Masahiko Sakai
:
Conditions for confluence of innermost terminating term rewriting systems. Appl. Algebra Eng. Commun. Comput. 30(4): 349-360 (2019)- [c9]Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi:
Confluence by Critical Pair Analysis Revisited. CADE 2019: 319-336 - [i2]Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi:
Confluence by Critical Pair Analysis Revisited (Extended Version). CoRR abs/1905.11733 (2019) - 2017
- [i1]Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi:
Critical Peaks Redefined - $Φ\sqcup Ψ= \top$. CoRR abs/1708.07877 (2017) - 2015
- [c8]Masahiko Sakai, Michio Oyamaguchi, Mizuhito Ogawa:
Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent. CADE 2015: 111-126 - 2010
- [j16]Ichiro Mitsuhashi, Michio Oyamaguchi, Kunihiro Matsuura:
The Unification Problem for Confluent Semi-Constructor TRSs. IEICE Trans. Inf. Syst. 93-D(11): 2962-2978 (2010)
2000 – 2009
- 2006
- [j15]Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada:
The Joinability and Related Decision Problems for Semi-constructor TRSs. Inf. Media Technol. 1(2): 796-808 (2006) - [j14]Ichiro Mitsuhashi, Michio Oyamaguchi, Toshiyuki Yamada:
The reachability and related decision problems for monadic and semi-constructor TRSs. Inf. Process. Lett. 98(6): 219-224 (2006) - [c7]Ichiro Mitsuhashi, Michio Oyamaguchi, Florent Jacquemard:
The Confluence Problem for Flat TRSs. AISC 2006: 68-81 - 2004
- [j13]Michio Oyamaguchi, Yoshikatsu Ohta:
On the Open Problems Concerning Church-Rosser of Left-Linear Term Rewriting Systems. IEICE Trans. Inf. Syst. 87-D(2): 290-298 (2004) - [c6]Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada:
The Joinability and Unification Problems for Confluent Semi-constructor TRSs. RTA 2004: 285-300 - 2003
- [j12]Michio Oyamaguchi, Yoshikatsu Ohta:
The unification problem for confluent right-ground term rewriting systems. Inf. Comput. 183(2): 187-211 (2003) - 2001
- [c5]Michio Oyamaguchi, Yoshikatsu Ohta:
The Unification Problem for Confluent Right-Ground Term Rewriting Systems. RTA 2001: 246-260
1990 – 1999
- 1997
- [c4]Michio Oyamaguchi, Yoshikatsu Ohta:
A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems. RTA 1997: 187-201 - 1994
- [c3]Yoshihito Toyama, Michio Oyamaguchi:
Church-Rosser Property and Unique Normal Form Property of Non-Duplicating Term Rewriting Systems. CTRS 1994: 316-331 - 1993
- [j11]Michio Oyamaguchi:
NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems. SIAM J. Comput. 22(1): 114-135 (1993)
1980 – 1989
- 1987
- [j10]Michio Oyamaguchi:
The equivalence problem for real-time DPDAs. J. ACM 34(3): 731-760 (1987) - [j9]Michio Oyamaguchi:
The Church-Rosser Property for Ground Term-Rewriting Systems is Decidable. Theor. Comput. Sci. 49: 43-79 (1987) - 1985
- [j8]Michio Oyamaguchi:
On the Data Type Extension Problem for Algebraic Specifications. Theor. Comput. Sci. 35: 329-336 (1985) - 1984
- [j7]Michio Oyamaguchi:
Some Remarks on Subclass Containment Problems for Several Classes of DPDA's. Inf. Process. Lett. 19(1): 9-12 (1984) - [j6]Michio Oyamaguchi:
Some Results on Subclass Containment Problems for Special Classes of DPDA's Related to Nonsingular Machines. Theor. Comput. Sci. 31: 317-335 (1984) - 1983
- [c2]Michio Oyamaguchi:
Relationship Between Abstract and Concrete Implementations of Algebraic Specifications. IFIP Congress 1983: 407-412 - 1981
- [j5]Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda:
The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine. J. Comput. Syst. Sci. 23(3): 366-382 (1981) - 1980
- [j4]Michio Oyamaguchi, Namio Honda:
The Equivalence Problem for Real-Time Strict Deterministic Languages. Inf. Control. 45(1): 90-115 (1980) - [j3]Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda:
A Real-Time Strictness Test for Deterministic Pushdown Automata. Inf. Control. 47(1): 1-9 (1980) - [j2]Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda:
A Simplicity Test for Deterministic Pushdown Automata. Inf. Control. 47(1): 10-36 (1980) - [c1]Michio Oyamaguchi, Yasuyoshi Inagaki, Namio Honda:
On the Equivalence Problem for Two DPDA's, One of which is Real-Time. IFIP Congress 1980: 53-58
1970 – 1979
- 1978
- [j1]Michio Oyamaguchi, Namio Honda:
The Decidability of Equivalence for Determistic Stateless Pushdown Automata. Inf. Control. 38(3): 367-376 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
