Compute inclusion depth of a pattern

Authors:
Wei Luo
Affiliations:
School of Computing Science, Simon Fraser University, Vancouver, Canada
Venue:
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Year:
2005

Citing 4
Cited 4

On the role of procrastination in machine learning

Information and Computation
Ordinal mind change complexity of language identification

Theoretical Computer Science
Inclusion is Undecidable for Pattern Languages

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Mind change efficient learning

COLT'05 Proceedings of the 18th annual conference on Learning Theory

Mind change efficient learning

Information and Computation
Bad News on Decision Problems for Patterns

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Bad news on decision problems for patterns

Information and Computation
Mind change efficient learning

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a concept of inclusion depth (see Definition 1) to capture mind-change complexity [3,1] of pattern identification problems [2]. Our basic question is whether the inclusion depth for any pattern is computable. We conjecture a combinatorial characterization that, if true, leads to a linear time algorithm to compute inclusion depth.