Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

Theoretical Computer Science

Volumn 261, Issue 1, 2001, Pages 119-156

  Erlebach, Thomas ^a   Rossmanith, Peter ^a   Stadtherr, Hans ^a   Steger, Angelika ^a   Zeugmann, Thomas ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

Average case analysis; Inductive learning; One variable pattern languages; Parallelization

Indexed keywords

ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBABILITY; QUERY LANGUAGES; SET THEORY;

INDUCTIVE LEARNING;

LEARNING SYSTEMS;

EID: 0034920514     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00136-5     Document Type: Conference Paper

References (39)

1. Deterministic simulation of idealized parallel computers on more realistic ones
2. Finding patterns common to a set of strings
3. Inductive inference of formal languages from positive data
4. Queries and concept learning
5. Avoidable patterns in strings of symbols
6. On the complexity of inductive inference
7. The relation of two patterns with comparable languages
8. Parallelism in random access machines
9. Prudence and other restrictions in formal language learning
10. Language identification in the limit
11. Polynomial time inference of general pattern languages
12. Monotonic and nonmonotonic inductive inference of functions and patterns
13. Inclusion is undecidable for pattern languages
14. Efficient PRAM simulation on a distributed memory
15. A polynomial-time algorithm for learning k-variable pattern languages from examples
16. A note on the two-variable pattern-finding problem
17. Polynomial-time inference of arbitrary pattern languages
18. Set-driven and rearrangement-independent learning of recursive languages
19. Identification of pattern languages from examples and queries
20. Inductive inference, DFAs and computational complexity
21. Patterns (The formal language theory column)
22. Return to patterns (The formal language theory column)
23. Polynomial time inference of pattern languages and its applications
24. Polynomial time inference of extended regular pattern languages
25. Pattern inference
26. Inductive inference of unbounded unions of pattern languages from positive data
27. Über unendliche Zeichenreihen
28. A theory of the learnable
29. Ignoring data may be the only way to learn efficiently
30. Parallel algorithms
31. Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
32. A guided tour across the boundaries of learning recursive languages