Tree-Based Generation of Restricted Graph Languages

DOI10.1142/S0129054123480106MaRDI QIDQ6195089zbMATH OpenFDO

Authors Henrik Björklund, Johanna Björklund, Petter Ericson

Publication date 16 February 2024

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

minimizationMAT learninggraph languageslogic characterisation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Recommendations

• On the regularity and learnability of ordered DAG languages
• Parsing weighted order-preserving hyperedge replacement grammars
• scientific article; zbMATH DE number 1504824
• Uniform parsing for hyperedge replacement grammars
• scientific article; zbMATH DE number 4049100

Cites work

• scientific article; zbMATH DE number 3947593 (Why is no real title available?)
• scientific article; zbMATH DE number 2040902 (Why is no real title available?)
• scientific article; zbMATH DE number 7568231 (Why is no real title available?)
• (Re)introducing regular graph languages
• A regular characterization of graph languages definable in monadic second-order logic
• Between a rock and a hard place -- uniform parsing for hyperedge replacement DAG grammars
• Bisimulation Minimisation for Weighted Tree Automata
• Handbook of weighted automata
• Learning Deterministically Recognizable Tree Series — Revisited
• Learning deterministically recognizable tree series
• Learning regular sets from queries and counterexamples
• Minimizing deterministic weighted tree automata
• On the regularity and learnability of ordered DAG languages
• Properties of regular DAG languages
• Uniform parsing for hyperedge replacement grammars

This page was built for publication: Tree-Based Generation of Restricted Graph Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6195089)