Abstract
This paper revisits the theory of regular inference, in particular by extending the definition of structural completeness of a positive sample and by demonstrating two basic theorems. This framework enables to state the regular inference problem as a search through a boolean lattice built from the positive sample. Several properties of the search space are studied and generalization criteria are discussed. In this framework, the concept of border set is introduced, that is the set of the most general solutions excluding a negative sample. Finally, the complexity of regular language identification from both a theoritical and a practical point of view is discussed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Aho and J. Ullman, The Theory of Parsing, Translation and Compiling, Vol. 1: Parsing, Series in Automatic Computation, Prentice-Hall, Englewood, Cliffs, 1972.
D. Angluin, On the Complexity of Minimum Inference of Regular Sets, Information and Control, Vol. 39, pp. 337–350, 1978.
D. Angluin, Inference of Reversible Languages, Journal of the ACM, Vol. 29, No. 3, pp. 741–765, 1982.
K.S. Fu and T.L. Booth, Grammatical Inference: Introduction and Survey, IEEE Transactions on SMC, Part 1: Vol. 5, pp. 85–111, Part 2: Vol. 5, pp. 409–423, 1975.
P. Garcia and E. Vidal, Inference of K-testable languages in the strict sense and applications to syntactic pattern recognition, IEEE Transactions on PAMI, Vol. 12, No. 9, pp. 920–925, 1990.
J. Gregor, Data-driven Inductive Inference of Finite-state Automata, International Journal of Pattern Recognition and Artificial Intelligence, Vol. 8, No. 1, pp. 305–322, 1994.
E.M. Gold, Language Identification in the Limit, Information and Control, Vol. 10, No. 5, pp. 447–474, 1967.
E.M. Gold, Complexity of Automaton Identification from Given Data, Information and Control, Vol. 37, pp. 302–320, 1978.
M.A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, Massachusetts, 1978.
M. Kearns and L. Valiant, Cryptographic Limitations on Learning Boolean Formulae and Finite Automata, Proc. of the 21st ACM Symposium on Theory of Computing, pp. 433–444, 1989.
K.J. Lang, Random DFA's can be Approximately Learned from Sparse Uniform Examples, Proc. of the 5th ACM workshop on Computational Learning Theory, pp. 45–52, 1992.
L. Miclet, Inférence de Grammaires Régulières, Thèse de Docteur-Ingénieur, E.N.S.T., Paris, France, 1979.
L. Miclet, Regular Inference with a Tail-Clustering Method, IEEE Trans. on SMC, Vol. 10, pp. 737–743, 1980.
L. Miclet and C. de Gentile, Inférence Grammaticale à partir d'Exemples et de Contre-Exemples: deux Algorithmes Optimaux (BIG et RIG) et une Version Heuristique (BRIG), Actes des JFA-94, Strasbourg, France, pp. F1–F13, 1994.
S. Muggleton, Induction of Regular Languages from Positive Examples, Turing Institute Report, TIRM-84-009, 1984.
J. Oncina and P. Garcia, Inferring Regular Languages in Polynomial Update Time, Pattern Recognition and Image Analysis, N. Perrez de la Blanca, A. Sanfeliu and E. Vidal (editors), Series in Machine Perception and Artificial Intelligence, Vol. 1, pp. 49–61, World Scientific, 1992.
L. Pitt, Inductive Inference, DFA's, and Computational Complexity, Lecture Notes in Artificial Intelligence, K.P. Jantke (editor), No. 397, Springer-Verlag, Berlin, pp. 18–44, 1989.
L. Pitt and M. Warmuth, The Minimum Consistent DFA Problem Cannot be Approximated Within any Polynomial, Tech. Report UIUCDCS-R-89-1499, University of Illinois, 1989.
B. Trakhtenbrot and Ya. Barzdin, Finite Automata: Behavior and Synthesis, North Holland Pub. Comp., Amsterdam, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dupont, P., Miclet, L., Vidal, E. (1994). What is the search space of the regular inference?. In: Carrasco, R.C., Oncina, J. (eds) Grammatical Inference and Applications. ICGI 1994. Lecture Notes in Computer Science, vol 862. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58473-0_134
Download citation
DOI: https://doi.org/10.1007/3-540-58473-0_134
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58473-5
Online ISBN: 978-3-540-48985-6
eBook Packages: Springer Book Archive