SnS can be modally characterized

Hans Hüttel

doi:10.1016/0304-3975(90)90140-D

SnS can be modally characterized

Hans Hüttel^*

^*Corresponding author for this work

Research output: Contribution to journal › Journal article › Research › peer-review

3 Citations (Scopus)

Abstract

We show that a modal mu-calculus with label set {1,...,n} can define the Rabin recognizable tree languages up to an equivalence similar to the observational equivalence of Milner.

Original language	English
Journal	Theoretical Computer Science
Volume	74
Issue number	2
Pages (from-to)	239-248
Number of pages	10
ISSN	0304-3975
DOIs	https://doi.org/10.1016/0304-3975(90)90140-D
Publication status	Published - 1990
Externally published	Yes

Access to Document

10.1016/0304-3975(90)90140-D

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

@article{9117803ed5484b52b5fbe08a960135e3,

title = "SnS can be modally characterized",

abstract = "We show that a modal mu-calculus with label set {1,...,n} can define the Rabin recognizable tree languages up to an equivalence similar to the observational equivalence of Milner.",

author = "Hans H{\"u}ttel",

year = "1990",

doi = "10.1016/0304-3975(90)90140-D",

language = "English",

volume = "74",

pages = "239--248",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - SnS can be modally characterized

AU - Hüttel, Hans

PY - 1990

Y1 - 1990

N2 - We show that a modal mu-calculus with label set {1,...,n} can define the Rabin recognizable tree languages up to an equivalence similar to the observational equivalence of Milner.

AB - We show that a modal mu-calculus with label set {1,...,n} can define the Rabin recognizable tree languages up to an equivalence similar to the observational equivalence of Milner.

UR - http://www.scopus.com/inward/record.url?scp=0025471889&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(90)90140-D

DO - 10.1016/0304-3975(90)90140-D

M3 - Journal article

AN - SCOPUS:0025471889

SN - 0304-3975

VL - 74

SP - 239

EP - 248

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 2

ER -

SnS can be modally characterized

Abstract

Access to Document

AUB Link

Other files and links

Fingerprint

Cite this