Probabilistic hyperedge replacement grammars
From MaRDI portal
Publication:1351216
DOI10.1016/0304-3975(95)00202-2zbMath0872.68098OpenAlexW2053946037MaRDI QIDQ1351216
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00202-2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperedge replacement: grammars and languages
- Monadic second-order evaluations on tree-decomposable graphs
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
- The complexity of graph languages generated by hyperedge replacement
- Moments of string and derivation lengths of stochastic context-free grammars
- The solution of some random NP-hard problems in polynomial expected time
- Graph expressions and graph rewritings
- Grammatical Inference: Introduction and Survey - Part I
- Entropies of probabilistic grammars
- Applying Probability Measures to Abstract Languages
This page was built for publication: Probabilistic hyperedge replacement grammars
