Skip to main content
SpringerLink
Log in

Context-free languages of infinite words as least fixpoints

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

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

Included in the following conference series:

  • 157 Accesses

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. ADJ-group: Some fundamentals of order algebraic semantics. MFCS '76, Lect. Notes in Comp. Sci. 45, 1976

    Google Scholar 

  2. Arnold,A., Nivat,M.: Formal computations of non deterministic recursive program schemes. Math. Syst. Th. 13, 1980

    Google Scholar 

  3. Back,J.: The semantics of unbounded non-determinism. ICALP '80, Lect. Notes in Comp. Sci. 85, 1980

    Google Scholar 

  4. Huwig,H.,Poigné,A.: Continuous and non-deterministic completions of algebras. 3rd Hungarian Comp. Sci. Conf., 1981

    Google Scholar 

  5. MacLane,S.: Kategorien. Berlin-Heidelberg-New-York 1972

    Google Scholar 

  6. Manes, E.G.: Algebraic theories. Berlin-Heidelberg-New-York 1976

    Google Scholar 

  7. Nivat,M.: Infinite words. Found. of Comp. Sci.III, ed: deBakker,J., van Leuwen,J., Amsterdam 1979

    Google Scholar 

  8. Nivat,M.: Mots infinie engendré par une grammaire algébrique. R.A.I.R.O. informatique theorique Vol. 11, 1977

    Google Scholar 

  9. Hennessy,M.C.B.,Plotkin,G.: Full abstraction of a simple programming language. MFCS '79, Lect. Notes in Comp. Sci. 74. 1979

    Google Scholar 

  10. Poigné,A.: Using least fixed points to characterize formal computations of non-deterministic equations. Proc. Formal. of Progr. Concepts, Peniscola, Lect. Notes in Comp. Sci. 105, 1981

    Google Scholar 

  11. Poigné,A.: A least fixpoint semantics of non-deterministic schemes. forthcoming

    Google Scholar 

  12. Schützenberger,M.P.: Push-down automata and context-free languages. Inf. and Contr. Vol 6, 1963

    Google Scholar 

  13. Courcelle,B.: Frontiers of infinite trees. RAIRO Inf.Theor. 12, 1978

    Google Scholar 

  14. Heilbrunner,S.: An algorithm for the solution of fixed-point equations for infinite words. RAIRO Inf. Theor. Vol 14, 1980

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik II Universität Dortmund, Postfach 50 05 00, D-4600, Dortmund 50, F.R.G.

    Axel Poigné

Authors
  1. Axel Poigné
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Poigné, A. (1981). Context-free languages of infinite words as least fixpoints. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38765-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation