Newton’s Method for ω-Continuous Semirings

DOI10.1007/978-3-540-70583-3_2zbMath1155.68364OpenAlexW136425998MaRDI QIDQ3520300

Stefan Kiefer, Javier Esparza, Michael Luttenberger

Publication date: 19 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_2

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Axiomatizing rational power series over natural numbers ⋮ Bounded underapproximations ⋮ The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems ⋮ Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Derivation-bounded languages
• Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations
• On Fixed Point Equations over Commutative Semirings
• A Fully Equational Proof of Parikh's Theorem
• Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
• An Extension of Newton’s Method to ω-Continuous Semirings
• On Context-Free Languages
• On the index of a context-free grammar and language
• Inclusion relations among families of context-free languages
• A few remarks on the index of context-free grammars and languages
• STACS 2005

This page was built for publication: Newton’s Method for ω-Continuous Semirings