scientific article; zbMATH DE number 2089362

MaRDI QIDQ3046706zbMATH OpenFDO

Authors Colin de la Higuera, Jose Oncina

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2375/23750185.htm

Mathematics Subject Classification ID

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

Recommendations

• Identification with probability one of stochastic deterministic linear languages
• scientific article; zbMATH DE number 67617
• Polynomial time learning of simple deterministic languages via queries and a representative sample
• Learning deterministic even linear languages from positive examples
• Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries

Cited in

(22)

• Grammatical inference for even linear languages based on control sets
• Learning deterministic even linear languages from positive examples
• A descriptive characterisation of even linear languages
• Deterministic biautomata and subclasses of deterministic linear languages
• LARS: a learning algorithm for rewriting systems
• On linear languages recognized by deterministic biautomata
• On inferring linear single-tree languages
• Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries
• Learning Deterministic DEC Grammars Is Learning Rational Numbers
• Streaming algorithms for language recognition problems
• scientific article; zbMATH DE number 67617 (Why is no real title available?)
• scientific article; zbMATH DE number 522856 (Why is no real title available?)
• Linear-time suffix parsing for deterministic languages
• scientific article; zbMATH DE number 2019607 (Why is no real title available?)
• scientific article; zbMATH DE number 845930 (Why is no real title available?)
• On the Transformation of LL(k)-linear Grammars to LL(1)-linear
• A grammatical inference for harmonic linear languages
• Grammatical Inference: Algorithms and Applications
• Identification with probability one of stochastic deterministic linear languages
• On the transformation of LL(k)-linear to LL(1)-linear grammars
• Learning strongly deterministic even linear languages from positive examples
• Extension complexity of formal languages

This page was built for publication:

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