Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
96
Voted
ENTCS
1998
79
views
more
ENTCS 1998
»
Covarieties and Complete Covarieties
15 years 2 months ago
Download
www.mathematik.uni-marburg.de
We present two ways to de ne covarieties and complete covarieties, i.e. covarieties that are closed under total bisimulation: by closure operators and by subcoalgebras of coalgebras.
H. Peter Gumm, Tobias Schröder
Real-time Traffic
ENTCS 1998
|
Ne Covarieties
|
Total Bisimulation
|
claim paper
Related Content
»
Coequational logic for accessible functors
»
Covarieties of Coalgebras Comonads and Coequations
»
Some CoBirkhoff Type Theorems
»
Modal Predicates and Coequations
»
On Minimal Coalgebras
»
Abstract Logics as Dialgebras
more »
Post Info
More Details (n/a)
Added
22 Dec 2010
Updated
22 Dec 2010
Type
Journal
Year
1998
Where
ENTCS
Authors
H. Peter Gumm, Tobias Schröder
Comments
(0)
Researcher Info
ENTCS 2010 Study Group
Computer Vision