Skip to main content
SpringerLink
Log in

Fragmentation: Enhancing Identifiability

  • Conference paper
  • First Online:
Grammatical Inference: Algorithms and Applications (ICGI 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2484))

Included in the following conference series:

  • 312 Accesses

Abstract

We introduce the concept of fragmentation in order to adapt the learnability of regular languages towards other regular and non-regular language families. More precisely, rational transducers can be used to implement explicit fragmentation to define new identifiable regular language classes. Context conditions can be used to construe identifiable and characterizable language classes which may contain non-regular languages by means of implicit fragmentation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46–62, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Angluin. Inductive inference of formal languages from positive data. Information and Control (now Information and Computation), 45:117–135, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. Angluin. Inference of reversible languages. Journal of the ACM, 29(3):741–765, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  4. E. Csuhaj-Varjú and A. Meduna. Grammars with context conditions (some results and open problems). EATCS Bulletin, 53:199–212, 1994.

    MATH  Google Scholar 

  5. J. Dassow and H. Hornig. Conditional grammars with subregular conditions. In 2nd International Colloquium on Words, Languages, and Combinatorics, pages 71–86. Kyoto Sangyo Unversity (Japan), World Scientific, August 1994.

    Google Scholar 

  6. J. Dassow and Gh. Păun. Regulated Rewriting in Formal Language Theory, volume 18 of EATCS Monographs in Theoretical Computer Science. Springer, 1989.

    Google Scholar 

  7. H. Fernau. Efficient learning of some linear matrix languages. In T. Asano et al., editors, COCOON’99, volume 1627 of LNCS, pages 221–230. Springer, 1999.

    Google Scholar 

  8. H. Fernau. Identification of function distinguishable languages. In H. Arimura, S. Jain, and A. Sharma, editors, Proceedings of the 11th International Conference Algorithmic Learning Theory ALT 2000, volume 1968 of LNCS/LNAI, pages 116–130. Springer, 2000.

    Chapter  Google Scholar 

  9. H. Fernau and M. Holzer. Conditional context-free languages of finite index. In Gh. Păun and A. Salomaa, editors, New Trends in Formal Languages, volume 1218 of LNCS, pages 10–26. Springer, 1997.

    Google Scholar 

  10. H. Fernau and A. Radl. Algorithms for learning function distinguishable regular languages. In Statistical and Syntactical Methods of Pattern Recognition SPR+SSPR, LNCS. Springer, 2002.

    Google Scholar 

  11. H. Fernau and J. M. Sempere. Permutations and control sets for learning non-regular language families. In A. L. Oliveira, editor, Grammatical Inference: Algorithms and Applications, 5th International Colloquium (ICGI 2000), volume 1891 of LNCS/LNAI, pages 75–88. Springer, 2000.

    Google Scholar 

  12. P. García and E. Vidal. Inference of k-testable languages in the strict sense and applications to syntactic pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12:920–925, 1990.

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  14. C. de la Higuera. Current trends in grammatical inference. In F. J. Ferri et al., editors, Advances in Pattern Recognition, Joint IAPR International Workshops SSPR+SPR’2000, volume 1876 of LNCS, pages 28–31. Springer, 2000.

    Google Scholar 

  15. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Reading (MA): Addison-Wesley, 1979.

    MATH  Google Scholar 

  16. S. Kobayashi and T. Yokomori. Learning approximately regular languages with reversible languages. Theoretical Computer Science, 174(1–2):251–257, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  17. C. Martin-Vide and Gh. Păun, editors. Recent topics in mathematical and computational linguistics, chapter H. Fernau and M. Holzer: External contextual and conditional languages, pages 104–120. Bucharest: The Publishing House of the Romanian Academy, 2000. ISBN 973-27-0770-4.

    Google Scholar 

  18. E. Navrátil. Context-free grammars with regular conditions. Kybernetika, 6:118–126, 1970.

    MathSciNet  MATH  Google Scholar 

  19. Gh. Păun. On the generative capacity of conditional grammars. Information and Control (now Information and Computation), 43:178–186, 1979.

    Article  MATH  Google Scholar 

  20. Gh. Păun. A variant of random context grammars: semi-conditional grammars. Theoretical Computer Science, 41:1–17, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  21. G. Rozenberg, K. Ruohonen, and A. K. Salomaa. Developmental systems with fragmentation. International Journal of Computer Mathematics, 5:177–191, 1976.

    Article  MathSciNet  Google Scholar 

  22. G. Rozenberg and A. Salomaa, editors. Handbook of Formal Languages (3 volumes). Springer, 1997.

    Google Scholar 

  23. Y. Takada. Learning formal languages based on control sets. In K. P. Jantke and S. Lange, editors, Algorithmic Learning for Knowledge-Based Systems, volume 961 of LNCS/LNAI, pages 317–339. Springer, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, University of Newcastle, University Drive, NSW, 2308, Callaghan, Australia

    Henning Fernau

  2. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, D-72076, Tübingen, Germany

    Henning Fernau

Authors
  1. Henning Fernau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Perot Systems Nederland B.V., Hoefseweg 1, 3821 AE, Amersfoort, The Netherlands

    Pieter Adriaans (Senior Research Advisor, Professor of Learning and Adaptive Systems) (Senior Research Advisor, Professor of Learning and Adaptive Systems)

  2. ILLC/Computation and Complexity Theory, Universiteit van Amsterdam, Plantage Muidergracht 24, 1018 TV, Amsterdam, The Netherlands

    Pieter Adriaans (Senior Research Advisor, Professor of Learning and Adaptive Systems) (Senior Research Advisor, Professor of Learning and Adaptive Systems)

  3. School of Electrical Engineering and Computer Science, University of Newcastle, University Drive, Callaghan, NSW, 2308, Australia

    Henning Fernau

  4. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, 72076, Tübingen, Germany

    Henning Fernau

  5. FNWI/ILLC, Cognitive Systems and Information Processing Group, Universiteit van Amsterdam, Room B-5.39, Nieuwe Achtergracht 166, 1018 WV, Amsterdam, The Netherlands

    Menno van Zaanen

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernau, H. (2002). Fragmentation: Enhancing Identifiability. In: Adriaans, P., Fernau, H., van Zaanen, M. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2002. Lecture Notes in Computer Science(), vol 2484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45790-9_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45790-9_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44239-4

  • Online ISBN: 978-3-540-45790-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation