Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars

DOI10.1007/978-3-319-30000-9_40zbMath1443.68077OpenAlexW2407660615MaRDI QIDQ2798746

Petter Ericson, Henrik Björklund, Frank Drewes

Publication date: 13 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30000-9_40

zbMATH Keywords

graph grammarparsinghyperedge replacementuniform membership problemabstract meaning representationDAG grammar

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Grammars and rewriting systems (68Q42)

Related Items (4)

On the regularity and learnability of ordered DAG languages ⋮ Uniform parsing for hyperedge replacement grammars ⋮ Transduction from trees to graphs through folding ⋮ Tree-Based Generation of Restricted Graph Languages

This page was built for publication: Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars