Grammatical inference of directed acyclic graph languages with polynomial time complexity (Q1747486): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: IgTM / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2777464707 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58201096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata on Directed Graphs: Edge Versus Vertex Marking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite graph automata for linear and boundary graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic inference of regular tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the Inference of Context Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Node Label Controlled Graph Grammars (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language identification in the limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3404129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic decision procedures for local testability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating Graph Parameters Using Graph Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural, Syntactic, and Statistical Pattern Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protein Motif Prediction by Grammatical Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism versus determinism of finite automata over directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing and compression with stochastic \(k\)-testable tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the learnability and usage of acyclic probabilistic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning context-free grammars from structural data in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient learning of context-free grammars from positive structural examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning context-free grammars using tabular representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Context-Sensitive Languages from Linear Structural Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time identification of very simple grammars from positive data. / rank
 
Normal rank

Latest revision as of 14:18, 15 July 2024

scientific article
Language Label Description Also known as
English
Grammatical inference of directed acyclic graph languages with polynomial time complexity
scientific article

    Statements

    Grammatical inference of directed acyclic graph languages with polynomial time complexity (English)
    0 references
    0 references
    0 references
    0 references
    8 May 2018
    0 references
    graph languages
    0 references
    graph automata
    0 references
    grammatical inference
    0 references
    \(k\)-testable languages
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers