TY - GEN
T1 - Solving fixed-point equations by derivation tree analysis
AU - Esparza, Javier
AU - Luttenberger, Michael
N1 - Funding Information:
This work was partially supported by the project “Polynomial Systems on Semirings: Foundations, Algorithms, Applications” of the Deutsche Forschungsgemeinschaft.
PY - 2011
Y1 - 2011
N2 - Systems of equations over ω-continuous semirings can be mapped to context-free grammars in a natural way. We show how an analysis of the derivation trees of the grammar yields new algorithms for approximating and even computing exactly the least solution of the system.
AB - Systems of equations over ω-continuous semirings can be mapped to context-free grammars in a natural way. We show how an analysis of the derivation trees of the grammar yields new algorithms for approximating and even computing exactly the least solution of the system.
UR - http://www.scopus.com/inward/record.url?scp=80053016223&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-22944-2_2
DO - 10.1007/978-3-642-22944-2_2
M3 - Conference contribution
AN - SCOPUS:80053016223
SN - 9783642229435
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 19
EP - 35
BT - Algebra and Coalgebra in Computer Science - 4th International Conference, CALCO 2011, Proceedings
T2 - 4th International Conference on Algebra and Coalgebra in Computer Science, CALCO 2011
Y2 - 30 August 2011 through 2 September 2011
ER -