An Extension of Newton’s Method to ω-Continuous Semirings
From MaRDI portal
Publication:5428228
DOI10.1007/978-3-540-73208-2_17zbMath1202.68106OpenAlexW1517554512MaRDI QIDQ5428228
Javier Esparza, Stefan Kiefer, Michael Luttenberger
Publication date: 28 November 2007
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73208-2_17
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (8)
Convergence of Newton's method over commutative semirings ⋮ Space-efficient scheduling of stochastically generated tasks ⋮ Newton’s Method for ω-Continuous Semirings ⋮ Unnamed Item ⋮ Derivation Tree Analysis for Accelerated Fixed-Point Computation ⋮ Derivation tree analysis for accelerated fixed-point computation ⋮ Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains ⋮ kProbLog: An Algebraic Prolog for Kernel Programming
This page was built for publication: An Extension of Newton’s Method to ω-Continuous Semirings
