Grammatical inference of directed acyclic graph languages with polynomial time complexity
From MaRDI portal
(Redirected from Publication:1747486)
Recommendations
Cites work
- scientific article; zbMATH DE number 177450 (Why is no real title available?)
- scientific article; zbMATH DE number 2080949 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- A Polynomial Algorithm for the Inference of Context Free Languages
- Algebraic decision procedures for local testability
- Automata on Directed Graphs: Edge Versus Vertex Marking
- Efficient learning of context-free grammars from positive structural examples
- Estimating Graph Parameters Using Graph Grammars
- Finite graph automata for linear and boundary graph languages
- Grammatical inference. Learning automata and grammars.
- Handbook of Graph Grammars and Computing by Graph Transformation
- Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Language identification in the limit
- Learning Context-Sensitive Languages from Linear Structural Information
- Learning Node Label Controlled Graph Grammars (Extended Abstract)
- Learning context-free grammars from structural data in polynomial time
- Learning context-free grammars using tabular representations
- Nondeterminism versus determinism of finite automata over directed acyclic graphs
- On the learnability and usage of acyclic probabilistic finite automata
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- Polynomial identification in the limit of substitutable context-free languages
- Polynomial-time identification of very simple grammars from positive data.
- Protein Motif Prediction by Grammatical Inference
- Smoothing and compression with stochastic \(k\)-testable tree languages
- Stochastic inference of regular tree languages
- Structural, Syntactic, and Statistical Pattern Recognition
This page was built for publication: Grammatical inference of directed acyclic graph languages with polynomial time complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747486)
