On the regularity and learnability of ordered DAG languages

DOI10.1007/978-3-319-60134-2_3MaRDI QIDQ2399247zbMATH OpenOpenAlexFDO

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

Publication date 22 August 2017

Full work available at URL https://doi.org/10.1007/978-3-319-60134-2_3

Mathematics Subject Classification ID

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

Recommendations

• Language theoretic properties of regular DAG languages
• Learning of Regular ω-Tree Languages
• Properties of regular DAG languages
• Learning regular languages over large ordered alphabets
• Algorithmic Learning Theory
• The complexity of regular DNLC graph languages
• Regular tree languages and quasi orders
• scientific article; zbMATH DE number 2019612
• Ordering regular languages and automata: complexity
• scientific article; zbMATH DE number 2019609

Cites work

• Between a rock and a hard place -- uniform parsing for hyperedge replacement DAG grammars
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Exact Learning of Finite Unions of Graph Patterns from Queries
• scientific article; zbMATH DE number 58315 (Why is no real title available?)
• Learning context-free grammars from structural data in polynomial time
• Learning deterministically recognizable tree series
• Learning Deterministically Recognizable Tree Series — Revisited
• Learning regular sets from queries and counterexamples
• MAT learners for tree series: an abstract data type and two realizations
• Polynomial inference of universal automata from membership and equivalence queries
• Query learning of regular tree languages: How to avoid dead states

Cited in

(8)

• Learning algorithms
• Language theoretic properties of regular DAG languages
• Uniform parsing for hyperedge replacement grammars
• Learning with partially ordered representations
• Tree-Based Generation of Restricted Graph Languages
• Parsing unranked tree languages, folded once
• The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited
• The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited

This page was built for publication: On the regularity and learnability of ordered DAG languages

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