Algebraic structures for transitive closure

From MaRDI portal
Publication:1238415

DOI10.1016/0304-3975(77)90056-1zbMath0358.68061OpenAlexW2039829163MaRDI QIDQ1238415

Daniel J. Lehmann

Publication date: 1977

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/46308/7/WRAP_Lehmann_cs-rr-010.pdf




Related Items

An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphsAlgebraic program analysisTransitive closure and related semiring properties via eliminantsPeriodic sets of integersIdempotent and tropical mathematics; complexity of algorithms and interval analysisMetabolic isotopomer labeling systems. III: Path tracingInductive semimodules and the vector modules over them.A unified framework for disambiguating finite transductionsPolynomial Functors Constrained by Regular ExpressionsEfficient algorithms for solving systems of linear equations and path problemsThe equational logic of fixed pointsUniversal algorithms for solving the matrix Bellman equations over semiringsAlgorithms for non-linear and stochastic resource constrained shortest pathUnnamed ItemALGORITHMS FOR THE JOIN AND AUTO-INTERSECTION OF MULTI-TAPE WEIGHTED FINITE-STATE MACHINESUnnamed ItemON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATATemporal constraint networksAlgebraic structures for transitive closureUniformizing Rational Relations for Natural Language Applications Using Weighted DeterminizationkProbLog: An Algebraic Prolog for Kernel ProgrammingTHE VALIDITY OF WEIGHTED AUTOMATAA systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)Universal numerical algorithms and their software implementationAllowable processing orders in the accelerated cascade algorithm


Uses Software


Cites Work