Identification with probability one of stochastic deterministic linear languages

DOI10.1007/B14273MaRDI QIDQ5897391zbMATH OpenOpenAlexFDO

Authors Colin de la Higuera, Jose Oncina

Publication date 23 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b14273

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Inferring deterministic linear languages
• Learning deterministic regular grammars from stochastic samples in polynomial time
• Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries
• On sufficient conditions to identify in the limit classes of grammars from polynomial time and data
• Learning deterministic even linear languages from positive examples

Cited in

(7)

• Learning probabilistic automata using residuals
• Identification in the limit with probability one of stochastic deterministic finite automata
• Inferring deterministic linear languages
• Learning Deterministic DEC Grammars Is Learning Rational Numbers
• Learning deterministic regular grammars from stochastic samples in polynomial time
• On sufficient conditions to identify in the limit classes of grammars from polynomial time and data
• Learning strongly deterministic even linear languages from positive examples

This page was built for publication: Identification with probability one of stochastic deterministic linear languages

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