On the regularity and learnability of ordered DAG languages
From MaRDI portal
Publication:2399247
DOI10.1007/978-3-319-60134-2_3zbMath1489.68120OpenAlexW2616975455MaRDI QIDQ2399247
Johanna Björklund, Petter Ericson, Henrik Björklund
Publication date: 22 August 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-60134-2_3
Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)
Related Items (3)
Uniform parsing for hyperedge replacement grammars ⋮ Tree-Based Generation of Restricted Graph Languages ⋮ Learning algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- MAT learners for tree series: an abstract data type and two realizations
- Query learning of regular tree languages: How to avoid dead states
- Polynomial inference of universal automata from membership and equivalence queries
- Learning context-free grammars from structural data in polynomial time
- Learning regular sets from queries and counterexamples
- Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars
- Exact Learning of Finite Unions of Graph Patterns from Queries
- Learning Deterministically Recognizable Tree Series — Revisited
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
This page was built for publication: On the regularity and learnability of ordered DAG languages
