Grammatical inference of directed acyclic graph languages with polynomial time complexity

DOI10.1016/J.JCSS.2017.12.002zbMATH Open1390.68362DBLPjournals/jcss/SanchezLC18OpenAlexW2777464707WikidataQ58201096 ScholiaQ58201096MaRDI QIDQ1747486FDOQ1747486

Authors: Antonio-Javier Gallego, Damián López, Jorge Calera-Rubio 

Publication date: 8 May 2018

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/136876

Recommendations

• Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
• Characteristic sets for polynomial grammatical inference
• scientific article; zbMATH DE number 177450
• scientific article; zbMATH DE number 6160572
• Grammatical inference. Learning automata and grammars.

zbMATH Keywords

grammatical inferencegraph languagesgraph automata\(k\)-testable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Cites Work

• Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
• Language identification in the limit
• Handbook of Graph Grammars and Computing by Graph Transformation
• Title not available (Why is that?)
• Stochastic inference of regular tree languages
• Learning context-free grammars from structural data in polynomial time
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Grammatical inference. Learning automata and grammars.
• Efficient learning of context-free grammars from positive structural examples
• A Polynomial Algorithm for the Inference of Context Free Languages
• On the learnability and usage of acyclic probabilistic finite automata
• Polynomial identification in the limit of substitutable context-free languages
• Learning Context-Sensitive Languages from Linear Structural Information
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic decision procedures for local testability
• Polynomial-time identification of very simple grammars from positive data.
• Learning context-free grammars using tabular representations
• Nondeterminism versus determinism of finite automata over directed acyclic graphs
• Finite graph automata for linear and boundary graph languages
• Automata on Directed Graphs: Edge Versus Vertex Marking
• Protein Motif Prediction by Grammatical Inference
• Smoothing and compression with stochastic \(k\)-testable tree languages
• Learning Node Label Controlled Graph Grammars (Extended Abstract)
• Estimating Graph Parameters Using Graph Grammars
• Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets
• Structural, Syntactic, and Statistical Pattern Recognition

Uses Software

• IgTM

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)