Tree-Based Generation of Restricted Graph Languages
From MaRDI portal
Publication:6195089
DOI10.1142/s0129054123480106MaRDI QIDQ6195089
Johanna Björklund, Petter Ericson, Henrik Björklund
Publication date: 16 February 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)
Cites Work
- Handbook of weighted automata
- Minimizing deterministic weighted tree automata
- Learning regular sets from queries and counterexamples
- A regular characterization of graph languages definable in monadic second-order logic
- On the regularity and learnability of ordered DAG languages
- Uniform parsing for hyperedge replacement grammars
- Properties of Regular DAG Languages
- Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars
- Learning Deterministically Recognizable Tree Series — Revisited
- Bisimulation Minimisation for Weighted Tree Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Tree-Based Generation of Restricted Graph Languages
