Maximally Parallel Contextual String Rewriting

DOI10.1007/978-3-319-44802-2_9zbMath1367.68152OpenAlexW2510499845MaRDI QIDQ2827840

Liviu P. Dinu, Traian-Florin Şerbănuţă

Publication date: 21 October 2016

Published in: Rewriting Logic and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44802-2_9

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Uses Software

• Maude
• K Prover

Cites Work

• Contextual insertions/deletions and computability
• An overview of the K semantic framework
• Membrane systems with promoters/inhibitors
• Computing with membranes
• Maude: specification and programming in rewriting logic
• On Insertion Grammars with Maximum Parallel Derivation
• Building program optimizers with rewriting strategies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximally Parallel Contextual String Rewriting