No label defined (Q4720787)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3992934
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3992934

      Statements

      1986
      0 references
      morphism iterate
      0 references
      fixed-point
      0 references
      context-free grammar
      0 references
      languages generated by nonterminals
      0 references
      flowchart program
      0 references
      rational system
      0 references
      unfoldment
      0 references
      program behaviour
      0 references
      recursive program
      0 references
      context-free system
      0 references
      \(\omega \)-continuous algebraic theory
      0 references
      least solution
      0 references
      [For the entire collection see Zbl 0596.00021.] In some branches of theoretical computer science we meet systems of equations whose solutions are obtained by a fixed-point technique: a) Every context-free grammar has its system. The least solution gives the languages generated by nonterminals. b) Every flowchart program has its rational system. The least solution gives the unfoldment. The interpretation of the unfoldment gives the program behaviour. c) Every recursive program has its context-free system. The least solution gives the unfoldment. The interpretation of the unfoldment gives the program behaviour. We present, in a categorical framework, the common methodology to solve such systems. For example, we define an \(\omega\)-continuous algebraic theory such that every finite system is a morphism whose iterate gives the least solution of the system.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references