Over-approximating terms reachable by context-sensitive rewriting

DOI10.1007/978-3-319-24537-9_12zbMATH Open1471.68104OpenAlexW2394981874MaRDI QIDQ1675159

Pierre Réty, Nirina Andrianarivelo

Publication date: 27 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-24537-9_12

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Automatically Proving and Disproving Feasibility Conditions

This page was built for publication: Over-approximating terms reachable by context-sensitive rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675159)