Least solutions of equations over N

DOI10.1007/3-540-58201-0_85zbMath1422.68036OpenAlexW1517963103MaRDI QIDQ4632443

Helmut Seidl

Publication date: 29 April 2019

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

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_85

zbMATH Keywords

ascending chain conditionabstract interpretationtree automatonrandom access machinecomplete partial order

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Monadic second-order evaluations on tree-decomposable graphs
• Properties of data flow frameworks: A unified model
• Abstract interpretation and application to logic programs
• Fixed points and frontiers: a new perspective
• Fibonacci heaps and their uses in improved network optimization algorithms
• Bounded Fixed-Point Iteration
• Unnamed Item
• Unnamed Item

This page was built for publication: Least solutions of equations over N