Determinization of inverted grammar programs via context-free expressions

DOI10.1016/J.JLAMP.2021.100688OpenAlexW3162301266MaRDI QIDQ1979968

Minami Niwa, Naoki Nishida

Publication date: 3 September 2021

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2021.100688

zbMATH Keywords

term rewritingcontext-free grammarregular expressionprogram inversion

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• LRinv

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rewriting extended regular expressions
• Program inversion: More than fun!
• Operational termination of conditional term rewriting systems
• Sound generalizations in mathematical induction
• Determinization of conditional term rewriting systems
• Coalgebraic Characterizations of Context-Free Languages
• Computing More Specific Versions of Conditional Rewriting Systems
• Improving Determinization of Grammar Programs for Program Inversion
• Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
• Automated termination proofs for logic programs by term rewriting
• A Grammar-Based Approach to Invertible Programs
• Automatic Partial Inversion of Inductively Sequential Functions
• Completion after Program Inversion of Injective Functions
• Program Inversion for Tail Recursive Functions
• Term Rewriting and Applications
• Programming Languages and Systems

This page was built for publication: Determinization of inverted grammar programs via context-free expressions