Solving Fixed-Point Equations by Derivation Tree Analysis
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 19-35
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Parikhʼs theorem: A simple and direct automaton constructionInformation Processing Letters, 2011
- Complexity of pattern-based verification for multithreaded programs2011
- Handbook of Weighted Automata2009
- Derivation Tree Analysis for Accelerated Fixed-Point Computation2008
- An Extension of Newton’s Method to ω-Continuous Semirings2007
- Efficient Computation of Throughput Values of Context-Free Languages2007
- On Fixed Point Equations over Commutative Semirings2007
- Equational Elements in Additive AlgebrasTheory of Computing Systems, 1999
- Recognizable formal power series on treesTheoretical Computer Science, 1982
- The Algebraic Theory of Context-Free Languages1963