Graph grammars with string-regulated rewriting
From MaRDI portal
Publication:652154
DOI10.1016/J.TCS.2011.07.004zbMATH Open1253.68198OpenAlexW2086761179WikidataQ56483812 ScholiaQ56483812MaRDI QIDQ652154FDOQ652154
Authors: Daniel Lobo, Francisco J. Vico, Jürgen Dassow
Publication date: 19 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.07.004
Recommendations
Cites Work
- Handle-rewriting hypergraph grammars
- Handbook of Graph Grammars and Computing by Graph Transformation
- Title not available (Why is that?)
- Adaptive star grammars and their languages
- Operations and language generating devices suggested by the genome evolution
- Title not available (Why is that?)
- String variable grammar: A logic grammar formalism for the biological language of DNA
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Degrees in random self-similar bipolar networks
- Graph grammars according to the type of input and manipulated data: a survey
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
- Title not available (Why is that?)
- Note on node-rewriting graph grammars
- Title not available (Why is that?)
This page was built for publication: Graph grammars with string-regulated rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652154)