Compactness and learning of classes of unions of erasing regular pattern languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2533, Issue , 2002, Pages 293-307

  Uemura, Jin ^a   Sato, Masako ^a  

^a Osaka Prefecture University   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SEMANTICS;

CHARACTERISTIC SET; EFFICIENT LEARNING; LANGUAGE DESCRIPTION; MINIMAL LANGUAGES; PATTERN LANGUAGES; POLYNOMIAL-TIME; POSITIVE EXAMPLES; REGULAR PATTERNS;

SYNTACTICS;

EID: 84942813611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36169-3_24     Document Type: Conference Paper

References (16)

1. D. Angluin: Finding patterns common to a set of strings, Information and Control, 21, 46–62, (1980).
2. D. Angluin: Inductive inference of formal languages form positive data, Information and Control, 45, 117–135, (1980).
3. D. Angluin: Inference of reversible language, Journal of the Association for Computing Machinery, 29(3), 741–765, (1982).
4. H. Arimura and T. Shinohara: Compactness for unions of regular pattern languages, Proc. of Symposium on Language and Automaton, Research on Computational Models and Complexity, RIMS Koukyuroku, 950, 246–249, (1996), (in Japanese).
5. H. Arimura, T. Shinohara and S. Otsuki: Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data, Lecture Notes in Computer Science, 775, 646–660, (1994).
6. E. M. Gold: Language identification in the limit, Information and Control, 10, 447–474, (1967).
7. C. B. Fraser, R.W. Irving and M. Middendorf: Maximal common subsequences and minimal common supersequences, Information and Computation, 124, 145–153, (1996).
8. D. Maier: The Complexity of Some Problems on Subsequences and Supersequences, JACM, 25, 322–336, (1978).
9. T. Moriyama and M. Sato: Properties of language classes with finite elasticity, IEICE Transactions on Information and Systems, E78-D(5), 532–538, (1995).
10. T. Motoki, T. Shinohara and K. Wright: The correct definition of finite elasticity: Corrigendum to identification of unions, Proc. of the 4th Annual Workshop on Computational Learning Theory, 375, (1991).
11. Y. Mukouchi: Containment problems for pattern languages, IEICE Transactions on Information and Systems, E75-D(4), 420–425, (1992).
12. M. Sato: Inductive Inference of Formal Languages, Bulletin of Informatics and Cybernetics, 27(1), 85–106, (1995).
13. M. Sato, Y. Mukouchi and D. Zheng: Characteristic sets for unions of regular pattern languages and compactness, Lecture Notes in Artificial Intelligence, 1501, 220–233, (1998).
14. T. Shinohara: Polynomial time inference of extended regular pattern languages, Proc. of RIMS Symposia on Software Science and Engineering, Lecture Notes in Computer Science, 147, 115–127, (1982).
15. T. Shinohara and H. Arimura: Inductive inference of unbounded unions of pattern languages from positive data, Proc. of the 7th International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence, 1160, 256–271, (1996).
16. K. Wright: Identification of unions of languages drawn from positive data, Proc. Of the 2nd Annual Workshop on Computational Learning Theory, 328–333, (1989).