Graphs of grammars - derivations as parallel processes

DOI10.1007/978-3-642-15220-7_1MaRDI QIDQ3058070zbMATH OpenOpenAlexFDO

Authors Benedek Nagy

Publication date 18 November 2010

Published in Computational Intelligence in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15220-7_1

zbMATH Keywords

automatadependency graphsderivationsformal languagesgrammarsgraphsL systemsparallel derivationsparallel processesPetri netsprogrammed grammarsrewriting systems

Mathematics Subject Classification ID

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

Cited in

(14)

• A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting
• scientific article; zbMATH DE number 3856437 (Why is no real title available?)
• On Insertion Grammars with Maximum Parallel Derivation
• On sequential and parallel node-rewriting graph grammars, II
• scientific article; zbMATH DE number 4035184 (Why is no real title available?)
• scientific article; zbMATH DE number 4049017 (Why is no real title available?)
• scientific article; zbMATH DE number 4094845 (Why is no real title available?)
• scientific article; zbMATH DE number 6819816 (Why is no real title available?)
• scientific article; zbMATH DE number 2112160 (Why is no real title available?)
• scientific article; zbMATH DE number 929620 (Why is no real title available?)
• Derivation trees for context-sensitive grammars
• Multiscale graph grammars can generate Cayley graphs of groups and monoids
• Parallel algorithms for a class of graphs generated recursively
• Graph grammars, insertion Lie algebras, and quantum field theory

This page was built for publication: Graphs of grammars - derivations as parallel processes

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