scientific article; zbMATH DE number 743586

zbMath0825.68442MaRDI QIDQ4763513

Arto Salomaa

Publication date: 18 April 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

pattern grammarfinite degrees of ambiguity

Mathematics Subject Classification ID

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

Related Items (10)

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

This page was built for publication: