Skip to main content
SpringerLink
Log in

Distributed catenation and chomsky hierarchy

  • Communications
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 965))

Included in the following conference series:

Abstract

We introduce a new operation between words and languages, called distributed catenation. The distributed catenation is a natural extension of the well known catenation operation from the theory of formal languages. As for partial shuffle operation the introduction of this operation is strongly motivated by the theory of concurrency. At the same time the distributed catenation is a powerful operation. For instance, any Turing machine can be simulated by a pushdown automaton that uses distributed catenation for the pushdown memory.

Research supported by the Academy of Finland, Project 11281.

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.

References

  1. J.S. Golan: The Theory of Semirings with Application in Mathematics and Theoretical Computer Science, Longman Scientific and Technical, 1992.

    Google Scholar 

  2. H. Jürgensen: Syntactic Monoids of Codes, Report 327, Dept.Comp.Sci., The University of Western Ontario, 1992.

    Google Scholar 

  3. W. Kuich, A. Salomaa: Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1986.

    Google Scholar 

  4. A. Mateescu: On (Left) Partial Shuffle, Proceedings of ‘Results and Trends in Theoretical Computer Science', LNCS 812, Springer-Verlag, (1994) 264–278.

    Google Scholar 

  5. C. Reutenauer: Free Lie Algebras, Clarendon Press, Oxford, 1993.

    Google Scholar 

  6. J. Sakarovitch, I. Simon: Subwords, in Combinatorics on Words, M. Lothaire (ed.), Addison-Wesley, Read. Mass., 1983.

    Google Scholar 

  7. A. Salomaa: Formal Languages, Academic Press, New York, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Germany

    Manfred Kudlek

  2. Faculty of Mathematics, University of Bucharest, Romania

    Alexandru Mateescu

  3. Academy of Finland and Department of Mathematics, University of Turku, Finland

    Alexandru Mateescu

Authors
  1. Manfred Kudlek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexandru Mateescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kudlek, M., Mateescu, A. (1995). Distributed catenation and chomsky hierarchy. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-60249-6_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60249-1

  • Online ISBN: 978-3-540-44770-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation