An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma
type: Item
instance of: scholarly article
title: An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma
zbMATH Open document ID: 0873.68157
DOI: 10.1016/0304-3975(95)00069-9
author: André Arnold
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 984959
zbMATH Keywords: tree automaton
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00069-9
OpenAlex ID: W2048686066
Wikidata QID: Q124999909
cites work: Q4273664
cites work: Results on the propositional \(\mu\)-calculus
cites work: Q4431395
cites work: Alternating automata on infinite trees
cites work: Q3730012
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q4385530
cites work: Infinite trees and automaton-definable relations over \(\omega\)-words
description: scientific article; zbMATH DE number 984959