Skip to content
<title>Channels - Efficient and Modular Coalgebraic Partition Refinement :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Efficient and Modular Coalgebraic Partition Refinement
Search for more channels:
Similar Items: Efficient and Modular Coalgebraic Partition Refinement
Channel Options
View Record
Explore related channels
Quick Look
Lowerbounds for Bisimulation by Partition Refinement
Quick Look
Correct and Efficient Antichain Algorithms for Refinement Checking
Quick Look
Bases as Coalgebras
Quick Look
Rational streams coalgebraically
Quick Look
Well-Pointed Coalgebras
Quick Look
Coalgebraic Behavioral Metrics
Quick Look
Duality for powerset coalgebras
Quick Look
Friendly primes for efficient modular arithmetic using the Polynomial Modular Number System
Quick Look
Non-Deterministic Kleene Coalgebras
Quick Look
Relating coalgebraic notions of bisimulation
Quick Look
Conway games, algebraically and coalgebraically
Quick Look
Completeness for the coalgebraic cover modality
Quick Look
Strongly Complete Logics for Coalgebras
Quick Look
Positive fragments of coalgebraic logics
Quick Look
Moss' logic for ordered coalgebras
Quick Look
Coalgebraic Automata Theory: Basic Results
Quick Look
EXPTIME Tableaux for the Coalgebraic mu-Calculus
Quick Look
Generalizing determinization from automata to coalgebras
Quick Look
Coalgebraic Characterizations of Context-Free Languages
Quick Look
Coalgebraic Infinite Traces and Kleisli Simulations
Quick Look
Coalgebraic Semantics for Probabilistic Logic Programming
Quick Look
Coalgebraic Geometric Logic: Basic Theory
Quick Look
Range (Rényi) Entropy Queries and Partitioning
Quick Look
Refining Inductive Types
Load more items
View Record
Prev
Explore related channels
Next
