On Distributive Fixed-Point Expressions

DOI10.1051/ITA:1999101MaRDI QIDQ4943552zbMATHOpenAlexFDO

Authors Helmut Seidl, Damian Niwiński

Publication date 16 March 2000

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/222054

zbMATH Keywords

lower boundsdistributivityalternation-depthfixed-point expression

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Distributive lattices (06D99) Inductive definability (03D70)

Recommendations

• On a generalization of distributivity
• On some solutions of the distributivity equation
• Distributivity and Varlet distributivity
• The distributivity equation for uninorms revisited
• scientific article; zbMATH DE number 3997858
• scientific article; zbMATH DE number 7523908
• The Distributivity Equations of Semi-Uninorms
• A fixed point theorem for distributions
• Refinement equations and distributional fixed points

Cites work

• scientific article; zbMATH DE number 3714896 (Why is no real title available?)
• scientific article; zbMATH DE number 3714908 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 3581599 (Why is no real title available?)
• scientific article; zbMATH DE number 475417 (Why is no real title available?)
• scientific article; zbMATH DE number 3999901 (Why is no real title available?)
• scientific article; zbMATH DE number 2102739 (Why is no real title available?)
• scientific article; zbMATH DE number 3198011 (Why is no real title available?)
• A calculational approach to mathematical induction
• Automata, languages and programming. 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings
• Computer aided verification. 5th international conference, CAV '93, Elounda, Greece, June 28 - July 1, 1993. Proceedings
• Fixed point characterization of infinite behavior of finite-state systems
• Theμ-calculus alternation-depth hierarchy is strict on binary trees

Cited in

(4)

• How deterministic are good-for-games automata?
• scientific article; zbMATH DE number 3960988 (Why is no real title available?)
• Checking history-determinism is NP-hard for parity automata
• Programming Languages and Systems

This page was built for publication: On Distributive Fixed-Point Expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943552)