Masahiko Sakai

From MaRDI portal
Person:407554

Available identifiers

zbMath Open sakai.masahikoMaRDI QIDQ407554

List of research outcomes





PublicationDate of PublicationType
Semantics and strong sequentially of priority term rewriting systems2022-12-09Paper
https://portal.mardi4nfdi.de/entity/Q49941292021-06-17Paper
Inverse Unfold Problem and Its Heuristic Solving2019-10-24Paper
A Parse-Based Framework for Coupled Rhythm Quantization and Score Structuring2019-10-17Paper
Conditions for confluence of innermost terminating term rewriting systems2019-08-27Paper
Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies2015-12-02Paper
Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent2015-12-02Paper
Completion after Program Inversion of Injective Functions2014-07-22Paper
Undecidable properties on length-two string rewriting systems2014-01-24Paper
Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems2014-01-24Paper
Transformation for refining unraveled conditional term rewriting systems2013-12-06Paper
Improving Determinization of Grammar Programs for Program Inversion2013-09-13Paper
Narrowing-based simulation of term rewriting systems with extra variables and its termination proof2013-08-27Paper
Determinization of conditional term rewriting systems2013-01-07Paper
Soundness of unravelings for conditional term rewriting systems via ultra-properties related to linearity2012-08-15Paper
Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity2012-04-24Paper
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent2012-03-27Paper
Controlled Term Rewriting2011-10-07Paper
Proving Injectivity of Functions via Program Inversion in Term Rewriting2010-05-04Paper
Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems2008-09-25Paper
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems2008-08-28Paper
Enhancing dependency pair method using strong computability in simply-typed term rewriting2007-11-19Paper
Term Rewriting and Applications2005-11-11Paper
https://portal.mardi4nfdi.de/entity/Q44091612003-06-30Paper
https://portal.mardi4nfdi.de/entity/Q45053812000-09-27Paper
https://portal.mardi4nfdi.de/entity/Q47056081999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q47056071999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42533241999-11-08Paper
Semantics and strong sequentiality of priority term rewriting systems1999-01-12Paper

Research outcomes over time

This page was built for person: Masahiko Sakai