Fixed Point Principles in Language Theory

  • Robert N. Moll
  • Michael A. Arbib
  • A. J. Kfoury
Part of the Texts and Monographs in Computer Science book series (MCS)

Abstract

Stir a cup of coffee with a spoon. It is a well-known fact of popular mathematics that some point in the coffee will be in its initial position after the stir. This drop of coffee is called a fixed point. Fixed points are extremely important objects in mathematics and computer science. In numerical methods, fixed points can be used to find roots of equations; in programming semantics, fixed point methods can be used to find the semantics (the meaning) of a program. Fixed point methods are useful in language theory too.

Keywords

Prefix Suffix 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1988

Authors and Affiliations

  • Robert N. Moll
    • 1
  • Michael A. Arbib
    • 2
  • A. J. Kfoury
    • 3
  1. 1.University of Massachusetts at AmherstAmherstUSA
  2. 2.University of Southern CaliforniaLos AngelesUSA
  3. 3.Boston UniversityBostonUSA

Personalised recommendations