On mix operation

  • Manfred Kudlek
  • Alexandru Mateescu
6. Algebraic Approaches to Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1218)


We consider operations between languages, based on splitting the underlying alphabet into two disjoint sets. Such operations are generalizations of the classical catenation or shuffle operation. With such operations rational and algebraic languages can be defined similar to the classical case. The basic properties of the corresponding language families are investigated.


Language Family Canonical Decomposition Classical Catenation Operation Closure Associative Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. S. Golan: The Theory of Semirings with Application in Mathematics and Theoretical Computer Science. Longman Scientific and Technical, 1992.Google Scholar
  2. 2.
    J. S. Golan, A. Mateescu, D. Vaida: Semirings and Parallel Composition of Processes. Journ. of Automata, Languages and Combinatorics, Vol.1 No. 3 199–217, 1996.Google Scholar
  3. 3.
    H. Jürgensen: Syntactic Monoids of Codes. Report 327, Dept.Comp.Sci., The University of Western Ontario, 1992.Google Scholar
  4. 4.
    M. Kudlek: Generalized Iteration Lemmata. PU.M.A., Vol. 6 No. 2, 211–216, 1995.Google Scholar
  5. 5.
    M. Kudlek, A. Mateescu: Distributed Catenation and Chomsky Hierarchy. LNCS 965, Springer, 313–322, 1995.Google Scholar
  6. 6.
    M. Kudlek, A. Mateescu: Rational and Algebraic Languages with Distributed Catenation. 'Developments in Language Theory II', At the Crossroads of Mathematics, Computer Science and Biology, ed. J. Dassow, G. Rozenberg, Arto Salomaa, World Scientific, 129–138, 1996.Google Scholar
  7. 7.
    M. Kudlek, A. Mateescu: On Distributed Catenation. Report Fac. Comp. Sci., Univ. Hamburg, FBI-Bericht 182/95, 1995.Google Scholar
  8. 8.
    W. Kuich, A. Salomaa: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, Springer, 1986.Google Scholar
  9. 9.
    A. Mateescu: On (Left) Partial Shuffle. Proceedings of’ Results and Trends in Theoretical Computer Science', LNCS 812, Springer, 264–278, 1994.Google Scholar
  10. 10.
    C. Reutenauer: Free Lie Algebras. Clarendon Press, 1993.Google Scholar
  11. 11.
    J. Sakarovitch, I. Simon: Subwords, in Combinatorics on Words. M. Lothaire, (ed.), Addison-Wesley, 1983.Google Scholar
  12. 12.
    A. Salomaa; Formal Languages. Academic Press, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Manfred Kudlek
    • 1
  • Alexandru Mateescu
    • 2
  1. 1.Fachbereich InformatikUniversität HamburgGermany
  2. 2.Faculty of MathematicsUniversity of BucharestBucureştiRomania

Personalised recommendations