Domain mu-calculus
From MaRDI portal
Publication:4460689
DOI10.1051/ita:2003023zbMath1038.03038OpenAlexW2089578870MaRDI QIDQ4460689
No author found.
Publication date: 29 March 2004
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2003__37_4_337_0
Formal languages and automata (68Q45) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Related Items
Decision problems for language equations, Unresolved systems of language equations: expressive power and decision problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On equations for regular languages, finite automata, and sequential networks
- Results on the propositional \(\mu\)-calculus
- Succinct representation of regular languages by Boolean automata
- Domain theory in logical form
- A completeness theorem for Kleene algebras and the algebra of regular events
- Fixed point characterization of infinite behavior of finite-state systems
- Completeness of Park induction
- Toward an infinitary logic of domains: Abramsky logic for transition systems
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- On the closure properties of linear conjunctive languages.
- A domain equation for bisimulation
- Constructions for alternating finite automata∗
- Alternation
- On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
- A Powerdomain Construction
- Equational axioms for regular sets
- Theμ-calculus alternation-depth hierarchy is strict on binary trees
- μ-definable sets of integers
- On a family of linear grammars
- Generalizations of regular events
