Decision lists over regular patterns.

DOI10.1016/S0304-3975(02)00419-XzbMath1038.68077OpenAlexW2029008210MaRDI QIDQ1874229

Jochen Nessel, Steffen Lange

Publication date: 22 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00419-x

zbMATH Keywords

regular languageslearnability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Decision lists over regular patterns.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A machine discovery from amino acid sequences by decision trees over regular patterns
• Decision lists over regular patterns.
• Decision problems for patterns
• Probably Approximate Learning of Sets and Functions
• A theory of the learnable
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Inductive inference of unbounded unions of pattern languages from positive data

This page was built for publication: Decision lists over regular patterns.