The following pages link to Yasuyoshi Inagaki (Q751325):
Displaying 19 items.
- The intersection searching problem for c-oriented polygons (Q751326) (← links)
- The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine (Q1158757) (← links)
- Addressable approximations to nonaddressable data graphs (Q1248365) (← links)
- (Q3217622) (← links)
- (Q3347271) (← links)
- (Q3731020) (← links)
- (Q3817565) (← 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)
- (Q4076799) (← links)
- A Note on the Linear Space Automata Stability Problem (Q4141152) (← links)
- AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES (Q4289632) (← links)
- (Q4703888) (← links)
- CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES" (Q4949994) (← links)
- Algebraic semantics and complexity of term rewriting systems (Q5055729) (← links)
- (Q5607594) (← links)
- Some aspects of linear space automata (Q5650332) (← links)
