Characteristic sets for unions of regular pattern languages and compactness

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

Volumn 1501, Issue , 1998, Pages 220-233

  Sato, Masako ^a   Mukouchi, Yasuhito ^a   Zheng, Dao ^a  

^a Osaka Prefecture University   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; SYNTACTICS;

CHARACTERISTIC SET; GENERAL PATTERNS; REGULAR PATTERNS;

LEARNING ALGORITHMS;

EID: 84961335885     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49730-7_17     Document Type: Conference Paper

References (14)

1. Angluin, D.: Finding patterns common to a set of strings, in Proceedings of the 11th Annual Symposium on Theory of Computing (1979) 130-141.
2. Angluin, D.: Inductive inference of formal languages from positive data,Informa-tion and Control 45 (1980) 117-135.
3. Arikawa, S., Shinohara, T. and Yamamoto, A.: Elementary formal systems as a unifying framework for language learning, in Proceedings of the 2nd Annual ACM Workshop on Computational Learning Theory (1989) 312-327.
4. Arikawa, S., Kuhara, S., Miyano S., Mukouchi, Y., Shinohara, A. and Shinohara, T.: A machine discovery from amino acid sequences by decision trees over regular patterns, in Proceedings of the International Conference on Fifth Generation Computer Systems (1992) 618-625 (also in New Generation Computing 11(3, 4) (1993) 361-375).
5. Arimura, H., Shinohara, T. and Otsuki, S.: Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data, in Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 775 (1994) 646-660.
6. Arimura, H. and Shinohara, T.: Compactness for unions of regular pattern languages, in Proceedings of the Symposium on Language and Automaton, Research on Computational Models and Complexity, RIMS Koukyuroku 950 (1996) 246-249 (in Japanese). 1
7. Gold, E.M.: Language identification in the limit, Information and Control 10 (1967) 447-474.0
8. Kobayashi, S. and Yokomori, T.: Identifiability of subspaces and homomorphic images of zero-reversible languages, in Proceedings of the 8th International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 1316 (1997) 48-61.
9. Motoki, T., Shinohara, T. and Wright, K.: The correct definition of finite elasticity: corrigendum to identification of unions, in Proceedings of the 4th Annual ACM Workshop on Computational Learning Theory (1991) 375-375.
10. Mukouchi, Y.: Characterization of pattern languages, in Proceedings of the 2nd Workshop on Algorithmic Learning Theory (1991) 93-104.
11. Sato, M.: Inductive inference of formal languages, Bulletin of Informatics and Cybernetics 27(1) (1995) 85-106.
12. Shinohara, T.: Polynomial time inference of pattern languages and its applications, in Proceedings of the 7th IBM Symposium on Mathematical Foundations of Computer Science (1982) 191-209.
13. Smullyan, R.M.: "Theory of formal systems," Princeton University Press, 1961.
14. Wright, K.: Identification of unions of languages drawn from an identifiable class, in Proceedings of the 2nd Annual Workshop on Computational Learning Theory (1989) 328-333.