Stochastic inference of regular tree languages

DOI10.1023/A:1010836331703MaRDI QIDQ5945687zbMATH OpenOpenAlexFDO

Authors Rafael C. Carrasco, Jose Oncina, Jorge Calera-Rubio

Publication date 14 October 2001

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1010836331703

zbMATH Keywords

grammatical inferenceregular language identification

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Learning deterministic regular grammars from stochastic samples in polynomial time
• Learning Rational Stochastic Tree Languages
• Computing the relative entropy between regular tree languages
• scientific article; zbMATH DE number 2089360
• Learning tree languages from text

Cited in

(25)

• The inference of tree languages from finite samples: An algebraic approach
• Grammatical inference of directed acyclic graph languages with polynomial time complexity
• Learning grammars for architecture-specific facade parsing
• Syntactic stochastic processes: definitions, models, and related inference problems
• Learning tree languages from positive examples and membership queries
• LARS: a learning algorithm for rewriting systems
• Smoothing and compression with stochastic \(k\)-testable tree languages
• A context-free language for binary multinomial processing tree models
• scientific article; zbMATH DE number 1670725 (Why is no real title available?)
• Error-correcting tree language inference
• Computing the relative entropy between regular tree languages
• On inferring linear single-tree languages
• Learning tree languages from text
• Learning Rational Stochastic Tree Languages
• Relevant Representations for the Inference of Rational Stochastic Tree Languages
• Large Scale Inference of Deterministic Transductions: Tenjinno Problem 1
• scientific article; zbMATH DE number 4060763 (Why is no real title available?)
• Learning deterministic regular grammars from stochastic samples in polynomial time
• Accurate computation of the relative entropy between stochastic regular grammars
• scientific article; zbMATH DE number 2019601 (Why is no real title available?)
• \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
• A Spectral Approach for Probabilistic Grammatical Inference on Trees
• Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
• Grammatical Inference: Algorithms and Applications
• scientific article; zbMATH DE number 957411 (Why is no real title available?)

This page was built for publication: Stochastic inference of regular tree languages

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