Search results
From MaRDI portal
- automata and regular expressions 2018-11-07 Paper Synchronous hyperedge replacement graph grammars 2018-08-24 Paper https://portal.mardi4nfdi.de/entity/Q5405158...10 bytes (19 words) - 06:48, 12 December 2023
- Publication Date of Publication Type Synchronous hyperedge replacement graph grammars 2018-08-24 Paper...10 bytes (16 words) - 20:04, 24 September 2023
- Publication Date of Publication Type Synchronous hyperedge replacement graph grammars 2018-08-24 Paper...10 bytes (16 words) - 20:04, 24 September 2023
- Publication Date of Publication Type Synchronous hyperedge replacement graph grammars 2018-08-24 Paper...10 bytes (16 words) - 20:04, 24 September 2023
- Publication Date of Publication Type Synchronous hyperedge replacement graph grammars 2018-08-24 Paper...10 bytes (16 words) - 20:04, 24 September 2023
- contextual hyperedge replacement grammars 2020-02-06 Paper Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars 2019-12-04...10 bytes (17 words) - 03:53, 7 October 2023
- contextual hyperedge replacement grammars 2020-02-06 Paper Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars 2019-12-04...10 bytes (16 words) - 17:41, 6 October 2023
- parsers for graph grammars based on hyperedge replacement 2019-06-20 Paper The use of tree transducers to compute translations between graph algebras 2019-01-10...10 bytes (16 words) - 18:21, 9 December 2023
- delay traversal of grammar-compressed graphs with bounded rank 2020-07-13 Paper Static garbage collection 2020-05-06 Paper Grammar-based compression of...10 bytes (16 words) - 01:39, 10 December 2023
- 2019-03-29 Paper The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed 2019-01-10 Paper The equivalence problem...10 bytes (17 words) - 09:40, 12 December 2023
- languages 2022-12-09 Paper Hyperedge replacement with rendezvous 2022-11-02 Paper Canonical derivations for high-level replacement systems 2022-08-16 Paper...10 bytes (19 words) - 21:23, 11 December 2023
- Workshop on Graph Computation Models 2008-11-20 Paper Graph Transformations 2007-06-21 Paper Graph Transformations 2007-06-21 Paper Graph Transformations...10 bytes (16 words) - 16:09, 12 December 2023
- Paper Learning algorithms 2022-02-04 Paper Uniform parsing for hyperedge replacement grammars 2021-03-10 Paper Uniform \textit{vs.} nonuniform membership...10 bytes (16 words) - 22:21, 10 December 2023
- languages 2019-06-18 Paper Chain-code pictures and collages generated by hyperedge replacement 2019-01-10 Paper https://portal.mardi4nfdi.de/entity/Q5376335 2018-09-17...10 bytes (17 words) - 17:43, 9 December 2023
- Restricted Graph Languages 2024-02-16 Paper https://portal.mardi4nfdi.de/entity/Q5094884 2022-08-04 Paper Uniform parsing for hyperedge replacement grammars...10 bytes (16 words) - 21:27, 24 September 2023
- event structure semantics for graph grammars with parallel productions 2019-01-10 Paper Synchronized composition of graph grammar productions 2019-01-10 Paper...10 bytes (17 words) - 19:24, 9 December 2023
- using graph grammars for abstracting unbounded heap structures 2015-10-20 Paper A Local Greibach Normal Form for Hyperedge Replacement Grammars 2011-06-03...10 bytes (16 words) - 05:36, 7 October 2023
- characteristic words 2011-06-16 Paper A Local Greibach Normal Form for Hyperedge Replacement Grammars 2011-06-03 Paper https://portal.mardi4nfdi.de/entity/Q3002435...10 bytes (16 words) - 09:57, 8 December 2023
- Programs 2014-09-26 Paper A Local Greibach Normal Form for Hyperedge Replacement Grammars 2011-06-03 Paper...10 bytes (16 words) - 05:36, 7 October 2023
- Publication Type An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars 2008-11-20 Paper...10 bytes (16 words) - 03:16, 28 December 2023