Maximally parallel contextual string rewriting

DOI10.1007/978-3-319-44802-2_9MaRDI QIDQ2827840zbMATH OpenOpenAlexFDO

Authors Traian Şerbănuţă, Liviu P. Dinu

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)

Recommendations

• scientific article; zbMATH DE number 3921957
• A formalization of sequential, parallel, and continuous rewriting
• scientific article; zbMATH DE number 1183245
• scientific article; zbMATH DE number 1735641
• Hierarchies of parallel rewriting P systems -- a survey

Cites work

• An overview of the K semantic framework
• Building program optimizers with rewriting strategies
• Computing with membranes
• Contextual insertions/deletions and computability
• scientific article; zbMATH DE number 48028 (Why is no real title available?)
• scientific article; zbMATH DE number 1179314 (Why is no real title available?)
• scientific article; zbMATH DE number 5267076 (Why is no real title available?)
• scientific article; zbMATH DE number 3307580 (Why is no real title available?)
• Maude: specification and programming in rewriting logic
• Membrane systems with promoters/inhibitors
• On Insertion Grammars with Maximum Parallel Derivation

Cited in

(3)

• Constrained many-to-one string editing with memory
• Non-Looping String Rewriting
• scientific article; zbMATH DE number 7260573 (Why is no real title available?)

Describes a project that uses

Uses Software

• K Prover
• Maude

This page was built for publication: Maximally parallel contextual string rewriting

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