Iterative and recursive matrix theories

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

Irène Guessarian, David B. Benson

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 theory; matrix theory; formal power series; algebraic systems of equations; closed under iteration and recursion; matricial theory; positive semirings; semantics of nondeterministic programming languages

Mathematics Subject Classification ID

12E12: Equations in general fields

68Q60: Specification and verification (program logics, model checking, etc.)

16Y60: Semirings

15A99: Basic linear algebra

18C10: Theories (e.g., algebraic theories), structure, and semantics

68N01: General topics in the theory of software

13F25: Formal power series rings

18B20: Categories of machines, automata

Related Items

On flowchart theories. II: The nondeterministic case, 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