Michio Oyamaguchi

Available identifiers

zbMath Open oyamaguchi.michioMaRDI QIDQ799386

List of research outcomes

Publication	Date of Publication	Type
Confluence by critical pair analysis revisited	2020-03-10	Paper
Conditions for confluence of innermost terminating term rewriting systems	2019-08-27	Paper
A new parallel closed condition for Church-Rosser of left-linear term rewriting systems	2017-11-17	Paper
Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent	2015-12-02	Paper
The reachability and related decision problems for monadic and semi-constructor TRSs	2010-01-18	Paper
Rewriting Techniques and Applications	2009-04-30	Paper
The Confluence Problem for Flat TRSs	2009-01-15	Paper
The unification problem for confluent right-ground term rewriting systems.	2003-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q2778882	2002-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q4937190	2000-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q4937216	2000-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q4705621	1999-12-20	Paper
https://portal.mardi4nfdi.de/entity/Q4705622	1999-12-20	Paper
https://portal.mardi4nfdi.de/entity/Q4253320	1999-11-02	Paper
NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems	1993-05-16	Paper
The Church-Rosser property for ground term-rewriting systems is decidable	1987-01-01	Paper
The equivalence problem for real-time DPDAs	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3780429	1986-01-01	Paper
On the data type extension problem for algebraic specifications	1985-01-01	Paper
Some remarks on subclass containment problems for several classes of dpda's	1984-01-01	Paper
Some results on subclass containment problems for special classes of dpda's related to nonsingular machines	1984-01-01	Paper
The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3886866	1980-01-01	Paper
The equivalence problem for real-time strict deterministic languages	1980-01-01	Paper
A simplicity test for deterministic pushdown automata	1980-01-01	Paper
A real-time strictness test for deterministic pushdown automata	1980-01-01	Paper
The decidability of equivalence for deterministic stateless pushdown automata	1978-01-01	Paper

Research outcomes over time

This page was built for person: Michio Oyamaguchi