Fixed-point semantics for algebraic (tree) grammars

Extended abstract
  • Damian Niwiński
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /AN 77/.
    -A.Arnold, M.Nivat, Non-deterministic recursive program schemes, FCT 77, LNCS 56, Springer Verlag (1977), 12–21.Google Scholar
  2. /AN 78/.
    -A.Arnold, M.Nivat, Metric interpretation of infinite trees and semantics of non deterministic recursive programs, Rapport no. IT-3-78,Universite de Lille.Google Scholar
  3. /N 79/.
    -M.Nivat, Infinite words, infinite trees, infinite computation, Mathematical Centre Tracts 109 (1979), 1–52.MathSciNetzbMATHGoogle Scholar
  4. /P 80/.
    -D.Park, On the semantics of fair parallelism, Abstract Software Specifications, LNCS 86, Springer Verlag(1980), 504–526.Google Scholar
  5. /T 79/.
    -J.Tiuryn, Fixed points in the power set algebra of infinite trees, Schriften zur Informatik und angewandten Mathematik, RWTH Aachen, (1979).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Damian Niwiński
    • 1
  1. 1.Institute of MathematicsWarsaw UniversityWarsawPoland

Personalised recommendations