Weighted DAG Automata for Semantic Graphs | Citedby Results | Computational Linguistics | MIT Press

Skip to Main Content

Skip Nav Destination

Weighted DAG Automata for Semantic Graphs

Computational Linguistics (2018) 44 (1): 119–186.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Tree-Based Generation of Restricted Graph Languages

Henrik Björklund
Johanna Björklund
Petter Ericson

International Journal of Foundations of Computer Science (2024) 35 (01n02): 215.

A New Notion of Regularity: Finite State Automata Accepting Graphs

Yvo Ad Meeres

Electronic Proceedings in Theoretical Computer Science (2024) 407: 5.

On the power of local graph expansion grammars with and without additional restrictions

Frank Drewes
Yannick Stade

Theoretical Computer Science (2024) 1015: 114763.

Transduction from trees to graphs through folding

Martin Berglund
Henrik Björklund
Johanna Björklund
Adrien Boiret

Information and Computation (2023) 295: 105111.

Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies

Johanna Björklund
Frank Drewes
Anna Jonsson

Computational Linguistics (2023) 49 (4): 841.

Bottom-up unranked tree-to-graph transducers for translation into semantic graphs

Johanna Björklund
Shay B. Cohen
Frank Drewes
Giorgio Satta

Theoretical Computer Science (2021) 870: 3.

Uniform parsing for hyperedge replacement grammars

Henrik Björklund
Frank Drewes
Petter Ericson
Florian Starke

Journal of Computer and System Sciences (2021) 118: 1.