Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

The Complexity of Enriched Mu-Calculi

Saved in:
Bibliographic Details
Published in:Logical Methods in Computer Science
Format: Online Article RSS Article
Published: 2008
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864030186471686149
collection WordPress RSS
FRELIP Feed Integration
container_title Logical Methods in Computer Science
description
discipline_display Engineering & Technology
discipline_facet Engineering & Technology
format Online Article
RSS Article
genre Journal Article
id rss_article:6634
institution FRELIP
journal_source_facet Logical Methods in Computer Science
publishDate 2008
publishDateSort 2008
record_format rss_article
spellingShingle The Complexity of Enriched Mu-Calculi
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
sub_discipline_display Computer Science & IT
sub_discipline_facet Computer Science & IT
subject_display Computer Science & Information Science
Computer Science & IT
Engineering & Technology
Computer Science & Information Science
Computer Science & IT
Engineering & Technology
subject_facet Computer Science & Information Science
Computer Science & IT
Engineering & Technology
title The Complexity of Enriched Mu-Calculi
title_auth The Complexity of Enriched Mu-Calculi
title_full The Complexity of Enriched Mu-Calculi
title_fullStr The Complexity of Enriched Mu-Calculi
title_full_unstemmed The Complexity of Enriched Mu-Calculi
title_short The Complexity of Enriched Mu-Calculi
title_sort the complexity of enriched mu-calculi
topic Computer Science & Information Science
Computer Science & IT
Engineering & Technology
url https://doi.org/10.2168/LMCS-4(3:11)2008