Matrix and matricial iteration theories. I

DOI10.1016/0022-0000(93)90010-TzbMath0791.08006OpenAlexW4213350984MaRDI QIDQ2366691

Stephen L. Bloom, Zoltán Ésik

Publication date: 18 August 1993

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(93)90010-t

zbMATH Keywords

iteration theoriesmatrices over a semiringmatrix theoriesKleene star operationmatrix iteration theorynondeterministic flowchart algorithmsprogram correctness logicsemiring of regular sets

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Abstract data types; algebraic specification (68Q65) Semirings (16Y60) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Related Items (33)

A connection between concurrency and language theory ⋮ A Finite Axiomatisation of Finite-State Automata Using String Diagrams ⋮ Feedback, trace and fixed-point semantics ⋮ Some quasi-varieties of iteration theories ⋮ Matrix and matricial iteration theories. II ⋮ Inductive \(^{*}\)-semirings ⋮ Fuzzy tree automata ⋮ Notes on equational theories of relations ⋮ Axiomatizing rational power series over natural numbers ⋮ Inductive semimodules and the vector modules over them. ⋮ Free inductive \(K\)-semialgebras ⋮ Weighted finite automata over hemirings ⋮ The equational logic of fixed points ⋮ The net automaton of a rational expression ⋮ On the equational definition of the least prefixed point. ⋮ Program correctness and matricial iteration theories ⋮ The variable hierarchy for the games \(\mu \)-calculus ⋮ Completeness for flat modal fixpoint logics ⋮ Equational properties of fixed-point operations in cartesian categories: An overview ⋮ On \(*\)-\(\lambda\)-semirings. ⋮ Fixed-point operations on ccc's. I ⋮ Equational properties of Kleene algebras of relations with conversion ⋮ Algebraic recognizability of regular tree languages ⋮ Multi-Linear Iterative K-Σ-Semialgebras ⋮ Algebraically complete semirings and Greibach normal form ⋮ The equational theory of regular words ⋮ Free \(\mu\)-lattices ⋮ Partial Conway and Iteration Semiring-Semimodule Pairs ⋮ Equational theories for automata ⋮ From Parity Games to Circular Proofs ⋮ Matrices, machines and behaviors ⋮ A Mezei-Wright theorem for categorical algebras ⋮ \(*\)-\(\mu\)-semirings and \(*\)-\(\lambda\)-semirings

Cites Work

• On flowchart theories. I. The deterministic case
• On flowchart theories. II: The nondeterministic case
• Matricial theories
• Regular and Algebraic Words and Ordinals
• Varieties of Iteration Theories
• Equational axioms for regular sets
• A Perspective View of Discrete Automata and Their Design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matrix and matricial iteration theories. I