Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Patterns and Languages: An Overview

  • Published:
Grammars

Abstract

The aim of this paper is to survey some language generative devices based on patterns reported during the last years. We recall in a uniform and systematic way nearly all generative mechanisms based on patterns known in the literature. The problems we address are mainly typical problems in formal language theory, namely generative power and closure under operations. Other aspects such as decidability and descriptional or computational complexity are briefly discussed in the final section.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Albert, J. and L. Wegner. Languages with homomorphic replacements, ICALP 80 Proceedings, LNCS 85: 19–29, 1980.

    Google Scholar 

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

    Article  Google Scholar 

  • Bean, D.R., A. Ehrenfeucht and G.F. McNulty. Avoidable patterns in strings of symbols, Pacific Journal of Math., 85: 261–294, 1979.

    Google Scholar 

  • Berstel, J. Mots sans careè et morphismes itèrès. Discrete Math., 29: 235–244, 1979.

    Article  Google Scholar 

  • Csuhaj-VarjÚ, E., J. Kelemen, A. Kelemenova and Gh. Păun. Eco(grammar) systems: A language theoretic model for AL. In R. TÚappl, editor, Proc. of Cybernetics and Systems'94, 1996.

  • Dassow, J. and V. Mitrana. DOL-pattern languages. PublicationesMathematicae, 54: 653–666, 1999.

    Google Scholar 

  • Dassow, J., Gh. Păun and A. Salomaa. Grammars based on patterns, International Journal of Foundations of Computer Science, 4: 1–14, 1993.

    Article  Google Scholar 

  • Dumitrescu, S., Gh. Păun and A. Salomaa. Languages associated to finite and infinite sets of patterns, Revue Roum. Math. Pures Appl., 49: 613–631, 1996.

    Google Scholar 

  • Duske, J. and R. Parchmann. Non-synchronized pattern languages are IO-macro languages. Journal of Automata, Languages and Combinatorics, 2: 143–150, 1997.

    Google Scholar 

  • Georgescu, G. Infinite hierarchies of pattern languages. Revue Roum. Math. Pures Appl., 51: 321–331, 1997.

    Google Scholar 

  • Gruska, J. The descriptional complexity of context-free languages. In Proc.MFCS Symp., 7–84, High Tatras, 1973.

  • Itai, A. Learning morphology — practice makes good. In C. Carrasco and J. Oncina, editors, Grammatical Inference and Applications LNCS, 862: 5–15, 1994.

  • Jantke, K.P. Algorithmic learning from incomplete information: Principles and problems. In J. Dassow and J. Kelemen, editors, Machines, Languages and Complexity, LNCS, 188–207, Springer-Verlag, 1989.

  • Jantke, K.P. Introducing a two-level grammar concept for design. In M. Kutrib and T. Worsch, editors, 5. Theorietag Automate und Formale Sprachen, 26–41, Giessen, 1995.

  • Jiang, T., E. Kinber, A. Salomaa, K. Salomaa and S. Yu. Pattern languages with and without erasing. International Journal of Computer Mathematics, 50: 147–163, 1994.

    Google Scholar 

  • Jiang, T., A. Salomaa, K. Salomaa and S. Yu. Inclusion is undecidable for pattern languages, In ICALP 93 Proceedings, LNCS 700, 301–312, 1993.

    Google Scholar 

  • Kari, L., A. Mateescu, Gh. Păun and A. Salomaa. Multi-pattern languages. Theoretical Computer Science, 141: 253–268, 1995.

    Article  Google Scholar 

  • Koskienniemi, K. Two-level morphology: A general computational model for word-form recognition and production. Technical Report No. 11, Dept. of General Linguistics, University of Helsinki, 1983.

  • Kucherov, G. and M. Rusinowitch. On ground reducidibility problem for word rewriting systems with variables. Technical Report CRIN 93-R-012, Centre de Recherche en Informatique de Nancy, 1993.

  • Langton, C.G. (editor). Artificial Life, Santa Fe Institute Studies in the Science of Complexity, Proc. vol. VI, Addison-Wesley, Reading, MA, 1989.

    Google Scholar 

  • Marcus, S. Contextual grammars. Rev. Roum. Math. Pures Appl., 14: 1525–1534, 1969.

    Google Scholar 

  • Mateescu, A. and A. Salomaa. Finite degrees of ambiguity in pattern languages. RAIRO, Th. Informatics, 28: 233–252, 1994.

    Google Scholar 

  • Mitrana, V. Eco-pattern systems. In Gh. Păun, editor, Artificial Life. Grammatical Models, 202–210, Black Sea University Press, Bucharest, 1995.

    Google Scholar 

  • Mitrana, V. Iterated pattern languages. Journal of Automata, Languages and Combinatorics, 1: 305–311, 1996.

    Google Scholar 

  • Mitrana, V., Gh. Păun, G. Rozenberg and A. Salomaa. Pattern systems, Theoretical Computer Science, 154: 183–201, 1996.

    Article  Google Scholar 

  • Morse, M. Recurrent geodesics on a surface of negative curvature. Trans. Am. Math. Soc., 22: 84–100, 1921.

    Article  Google Scholar 

  • Morse, M. A solution of the problem of infinite play in chess. Bull. Am. Math., 44: 632, 1938.

    Google Scholar 

  • Ohlebusch, E. and E. Ukkonen. On the equivalence problem for E-patterns languages. In Proc. of MFCS'96, LNCS 1113, 457–468, Springer, Berlin, 1996.

    Google Scholar 

  • Partee, B.H., A. ter Meulen and R.E. Wall. Mathematical Methods in Linguistics, Kluwer, Dordrecht, 1990.

    Google Scholar 

  • Păun, Gh., G. Rozenberg and A. Salomaa. Pattern grammars. Journal of Automata, Languages and Combinatorics, 1: 219–235, 1996.

    Google Scholar 

  • Rozenberg, G. and A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1980.

    Google Scholar 

  • Rozenberg, G. and A. Salomaa (editors). The Handbook of Formal Languages, Springer, Berlin, 1997.

    Google Scholar 

  • Salomaa, A. Patterns. Bull. EATCS, 54: 194–206, 1994.

    Google Scholar 

  • Salomaa, A. Return to patterns. Bull. EATCS, 55: 144–157, 1995.

    Google Scholar 

  • Thue, A. Ñber unendliche Zeichenreihen. Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Kristiania, 7: 1–22, 1906.

    Google Scholar 

  • Wijngaarden, A. van. Orthogonal design and description of formal languages. Technical Report Mathem. Centrum, Amsterdam, 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania. E-mail: mitrana@funinf.math.unibuc.ro

    Victor Mitrana

Authors
  1. Victor Mitrana
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mitrana, V. Patterns and Languages: An Overview. Grammars 2, 149–173 (1999). https://doi.org/10.1023/A:1009956010735

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009956010735

Search

Navigation