scientific article; zbMATH DE number 743586

MaRDI QIDQ4763513zbMATH OpenFDO

Authors Arto Salomaa

Publication date 18 April 1995

zbMATH Keywords

finite degrees of ambiguitypattern grammar

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Cited in

(10)

• Parallelism increases iterative learning power
• On the equivalence problem for E-pattern languages
• An average-case optimal one-variable pattern language learner
• Incremental concept learning for bounded data mining.
• Decision lists over regular patterns.
• A note on the complexity of matching patterns with variables
• Learning erasing pattern languages with queries
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
• From learning in the limit to stochastic finite learning
• Learning a subclass of regular patterns in polynomial time

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 Q4763513)