The following pages link to Michio Oyamaguchi (Q799386):
Displaying 27 items.
- Some remarks on subclass containment problems for several classes of dpda's (Q799387) (← links)
- On the data type extension problem for algebraic specifications (Q801668) (← links)
- The reachability and related decision problems for monadic and semi-constructor TRSs (Q844204) (← links)
- Some results on subclass containment problems for special classes of dpda's related to nonsingular machines (Q1060563) (← links)
- The Church-Rosser property for ground term-rewriting systems is decidable (Q1100890) (← links)
- The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine (Q1158757) (← links)
- The unification problem for confluent right-ground term rewriting systems. (Q1401934) (← links)
- Confluence by critical pair analysis revisited (Q2305423) (← links)
- Conditions for confluence of innermost terminating term rewriting systems (Q2321950) (← links)
- (Q2778882) (← links)
- Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent (Q3454085) (← links)
- The equivalence problem for real-time DPDAs (Q3777488) (← links)
- (Q3780429) (← links)
- (Q3886866) (← links)
- The equivalence problem for real-time strict deterministic languages (Q3888532) (← links)
- A simplicity test for deterministic pushdown automata (Q3908478) (← links)
- A real-time strictness test for deterministic pushdown automata (Q3949982) (← links)
- NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems (Q4037688) (← links)
- The decidability of equivalence for deterministic stateless pushdown automata (Q4174788) (← links)
- (Q4253320) (← links)
- A new parallel closed condition for Church-Rosser of left-linear term rewriting systems (Q4594227) (← links)
- (Q4705621) (← links)
- (Q4705622) (← links)
- (Q4937190) (← links)
- (Q4937216) (← links)
- The Confluence Problem for Flat TRSs (Q5302902) (← links)
- Rewriting Techniques and Applications (Q5901574) (← links)
