Abstract
A regular pattern is a string of constant symbols and distinct variables. A semantics of a set P of regular patterns is a union L(P) of erasing pattern languages generated by patterns in P. The paper deals with the class RPk of sets of at most k regular patterns, and an efficient learning from positive examples of the language class defined by RPk. In efficient learning languages, the complexity for the MINL problem to find one of minimal languages containing a given sample is one of very important keys. Arimura et al.[5] introduced a notion of compactness w.r.t. containment for more general framework, called generalization systems, than RPk of language description which guarantees the equivalency between the semantic containment L(P) ⫅ L(Q) and the syntactic containment P ⊑ Q, where ⊑ is a syntactic subsumption over the generalization systems.
Under the compactness, the MINL problem reduces to finding one of minimal sets in RP k for a given sample under the subsumption ⊑. They gave an efficient algorithm to find such minimal sets under the assumption of compactness and some conditions.
We first show that for each k ≥ 1, the class RP k has compactness if and only if the number of constant symbols is greater than k+1. Moreover, we prove that for each P ∈, RP k, a finite subset S 2(P) is a characteristic set of L(P) within the class, where S 2(P) consists of strings obtained from P by substituting strings with length two for each variable. Then our class RP k is shown to be polynomial time inferable from positive examples using the efficient algorithm of the MINL problem due to Arimura et al.[5], provided the number of constant symbols is greater than k + 1.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Angluin: Finding patterns common to a set of strings, Information and Control, 21, 46–62, (1980).
D. Angluin: Inductive inference of formal languages form positive data, Information and Control, 45, 117–135, (1980).
D. Angluin: Inference of reversible language, Journal of the Association for Computing Machinery, 29(3), 741–765, (1982).
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).
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).
E. M. Gold: Language identification in the limit, Information and Control, 10, 447–474, (1967).
C. B. Fraser, R.W. Irving and M. Middendorf: Maximal common subsequences and minimal common supersequences, Information and Computation, 124, 145–153, (1996).
D. Maier: The Complexity of Some Problems on Subsequences and Supersequences, JACM, 25, 322–336, (1978).
T. Moriyama and M. Sato: Properties of language classes with finite elasticity, IEICE Transactions on Information and Systems, E78-D(5), 532–538, (1995).
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).
Y. Mukouchi: Containment problems for pattern languages, IEICE Transactions on Information and Systems, E75-D(4), 420–425, (1992).
M. Sato: Inductive Inference of Formal Languages, Bulletin of Informatics and Cybernetics, 27(1), 85–106, (1995).
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).
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).
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).
K. Wright: Identification of unions of languages drawn from positive data, Proc. of the 2nd Annual Workshop on Computational Learning Theory, 328–333, (1989).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uemura, J., Sato, M. (2002). Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds) Algorithmic Learning Theory. ALT 2002. Lecture Notes in Computer Science(), vol 2533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36169-3_24
Download citation
DOI: https://doi.org/10.1007/3-540-36169-3_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00170-6
Online ISBN: 978-3-540-36169-5
eBook Packages: Springer Book Archive