Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1982: Automata, Languages and Programming pp 384–396Cite as

Fixed-point semantics for algebraic (tree) grammars

Extended abstract

  • Conference paper
  • First Online:

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

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. -A.Arnold, M.Nivat, Non-deterministic recursive program schemes, FCT 77, LNCS 56, Springer Verlag (1977), 12–21.

    Google Scholar 

  2. -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. -M.Nivat, Infinite words, infinite trees, infinite computation, Mathematical Centre Tracts 109 (1979), 1–52.

    MathSciNet  MATH  Google Scholar 

  4. -D.Park, On the semantics of fair parallelism, Abstract Software Specifications, LNCS 86, Springer Verlag(1980), 504–526.

    Google Scholar 

  5. -J.Tiuryn, Fixed points in the power set algebra of infinite trees, Schriften zur Informatik und angewandten Mathematik, RWTH Aachen, (1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Warsaw University, PKiN IX p., PL-00 901, Warsaw, Poland

    Damian Niwiński

Authors
  1. Damian Niwiński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Niwiński, D. (1982). Fixed-point semantics for algebraic (tree) grammars. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012785

Download citation

  • DOI: https://doi.org/10.1007/BFb0012785

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11576-2

  • Online ISBN: 978-3-540-39308-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation