A formalization of sequential, parallel, and continuous rewriting

DOI10.1080/00207169308804172MaRDI QIDQ4323388zbMATH OpenOpenAlexFDO

Authors Alexander Meduna

Publication date 16 February 1995

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169308804172

zbMATH Keywords

free monoidrewritingselective substitution grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 4039327
• A note on parallel rewriting in P systems
• scientific article; zbMATH DE number 992013
• On sequential and parallel node-rewriting graph grammars
• Remarks on accepting parallel systems

Cited in

(9)

• Sequentiality in orthogonal term rewriting systems
• Sequential and maximally parallel multiset rewriting: reversibility and determinism
• A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting
• Maximally parallel contextual string rewriting
• scientific article; zbMATH DE number 4039327 (Why is no real title available?)
• scientific article; zbMATH DE number 4043232 (Why is no real title available?)
• Middle quotients of linear languages
• scientific article; zbMATH DE number 897902 (Why is no real title available?)
• scientific article; zbMATH DE number 7453087 (Why is no real title available?)

This page was built for publication: A formalization of sequential, parallel, and continuous rewriting

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