Affordable Access

Publisher Website

Iteration and Summability in Semirings

Authors
Identifiers
DOI: 10.1016/s0304-0208(08)72965-7
Disciplines
  • Linguistics
  • Logic
  • Mathematics

Abstract

An algebraic treatment of various questions in linear algebra, automata and formal language theory, combinatorial optimization, data flow analysis, graph theory, semantics and others has exhibited the importance of transitive closure over semirings and the broad applicability of Gauss-Jordan elimination method. In view of these applications we study the solvability of equations of the form x=l+ax, called iteration, and introduct a concept of summability in positive semirings.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

On ∗–λ-semirings

on Information Sciences Jan 01, 2007

Soft semirings

on Computers & Mathematics with A... Jan 01, 2008
More articles like this..