Skip to main content
Springer Nature Link
Log in

Finite Automata and Unions of Regular Patterns with Bounded Constant Segments

  • Conference paper
Implementation and Application of Automata (CIAA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3845))

Included in the following conference series:

  • 435 Accesses

Abstract

The class of unbounded unions of regular pattern languages with bounded constant segments is identifiable from positive data in the limit [1]. Otherwise, no efficient algorithm that performs the inference of this class of languages is known. We propose a solution to this problem using the existing connexion between the positive variety of languages of dot depth 1/2, \({\mathcal LJ}^+\) [2] and the class of unbounded union of pattern languages \({\mathcal RP}^+{\mathcal L}\).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Shinohara, T., Arimura, H.: Inductive inference of unbounded unions of pattern languages from positive data. Theoretical Computer Science 241, 191–209 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Pin, J.E., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Systems 30, 1–38 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Angluin, D.: Finding common patterns to a set of strings. In: Proc. 11th Ann. Symp. Theory of Computing, pp. 130–141 (1979)

    Google Scholar 

  4. Arikawa, S., Kuhara, S., Miyano, S., Shinohara, A., Shinohara, T.: A learning algorithm for elementary formal systems and its experiments on identification of trandmembrane domains. In: Proc. 25th Hawaii Int. Conf. on System Science, vol. 1, pp. 675–684 (1992)

    Google Scholar 

  5. Pin, J.E., Weil, P.: The wreath product principle for ordered semigroups. Communications in Algebra 30, 5677–5713 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Garcia, P., Ruiz, J.: Learning in varieties of the form V*LI from positive data (to appear)

    Google Scholar 

  7. Garcia, P., Ruiz, J.: Learning k-testable and k-piecewise testable languages from positive data. Grammars. Special Issue on Grammar Induction, 125–140 (2004)

    Google Scholar 

  8. Hopcroft, J., Ullman, J.: Introduction to automata theory, languages and computation. Addison-Wesley, Reading (1980)

    MATH  Google Scholar 

  9. Gold, E.M.: Language identification in the limit. Information and Control, 447–474 (1967)

    Google Scholar 

  10. Pin, J.E.: Varieties of formal languages. North Oxford, London and Plenum, New York (1986) (Traduction of Variétés de langages formels)

    Google Scholar 

  11. Berstel, J.: Transductions and Context Free Languages. Teubner (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain

    Antonio Cano & Pedro García

Authors
  1. Antonio Cano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pedro García
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sophia Antipolis, Laboratoire I3S, Les Algorithmes - bât. Euclide B, Université de Nice, 2000, route des lucioles, BP 121, 06903, Sophia Antipolis - Cedex, France

    Jacques Farré

  2. Sophia Antipolis, Ecole Polytechnique, Université de Nice, 930, route des colles, BP 145, 06903, Sophia Antipolis - Cedex, France

    Igor Litovsky

  3. Laboratoire I3S, Université de Nice, Sophia Antipolis & CNRS, France

    Sylvain Schmitz

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cano, A., García, P. (2006). Finite Automata and Unions of Regular Patterns with Bounded Constant Segments. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_9

Download citation

  • DOI: https://doi.org/10.1007/11605157_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31023-5

  • Online ISBN: 978-3-540-33097-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics