Iterative and recursive matrix theories

DOI10.1016/0021-8693(84)90035-8zbMath0527.18004OpenAlexW2034351214MaRDI QIDQ595766

David B. Benson, Irène Guessarian

Publication date: 1984

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-8693(84)90035-8

zbMATH Keywords

algebraic theorymatrix theoryformal power seriesalgebraic systems of equationsclosed under iteration and recursionmatricial theorypositive semiringssemantics of nondeterministic programming languages

Mathematics Subject Classification ID

Equations in general fields (12E12) Specification and verification (program logics, model checking, etc.) (68Q60) Semirings (16Y60) Basic linear algebra (15A99) Theories (e.g., algebraic theories), structure, and semantics (18C10) General topics in the theory of software (68N01) Formal power series rings (13F25) Categories of machines, automata (18B20)

Related Items (3)

On flowchart theories. II: The nondeterministic case ⋮ Multi-Linear Iterative K-Σ-Semialgebras ⋮ Equational logic of circular data type specification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic and nondeterministic flowchart interpretations
• Regular trees and the free iterative theory
• The existence and construction of free iterative theories
• Matricial theories
• First-order dynamic logic
• Formal computations of non deterministic recursive program schemes
• On context-free languages and push-down automata
• A Perspective View of Discrete Automata and Their Design

This page was built for publication: Iterative and recursive matrix theories