Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Hallnas:1987:ICL,
author = "L. Hallnas",
title = "An intensional characterization of the largest
bisimulation",
journal = j-THEOR-COMP-SCI,
volume = "53",
number = "2--3",
pages = "335--343",
month = "????",
year = "1987",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "Swedish Inst. of Comput. Sci., Spanga, Sweden",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; calculus of communication systems;
finite approximations; intensional characterization;
largest bisimulation; trees (mathematics)",
pubcountry = "Netherlands A12",
treatment = "T Theoretical or Mathematical",
}