The following pages link to Alexandra Silva (Q418133):
Displaying 50 items.
- A coalgebraic perspective on linear weighted automata (Q418134) (← links)
- A model of context-dependent component connectors (Q436387) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure (Q890383) (← links)
- A coinductive calculus of binary trees (Q964505) (← links)
- Layer by layer -- combining monads (Q1623129) (← links)
- Convex language semantics for nondeterministic probabilistic automata (Q1623161) (← links)
- A compositional model to reason about end-to-end QoS in stochastic Reo connectors (Q1651010) (← links)
- On series-parallel pomset languages: rationality, context-freeness and automata (Q1734519) (← links)
- Actor-based model checking for software-defined networks (Q1996852) (← links)
- SDN-actors: modeling and verification of SDN programs (Q2024371) (← links)
- Moessner's theorem: an exercise in coinductive reasoning in \textsc{Coq} (Q2026804) (← links)
- Learning to coordinate (Q2028749) (← links)
- A categorical framework for learning generalised tree automata (Q2104477) (← links)
- Hennessy-Milner results for probabilistic PDL (Q2133481) (← links)
- Borel kernels and their approximation, categorically (Q2134827) (← links)
- Completeness and incompleteness of synchronous Kleene algebra (Q2176687) (← links)
- Concurrent Kleene algebra with observations: from hypotheses to completeness (Q2200836) (← links)
- Learning weighted automata over principal ideal domains (Q2200852) (← links)
- Learning automata with side-effects (Q2229229) (← links)
- Learning pomset automata (Q2233430) (← links)
- Left-handed completeness (Q2286746) (← links)
- Concurrent Kleene algebra: free model and completeness (Q2324010) (← links)
- Trace semantics via determinization (Q2341701) (← links)
- A tribute to José Nuno Oliveira (Q2374298) (← links)
- Completeness and incompleteness in nominal Kleene algebra (Q2401017) (← links)
- A (co)algebraic theory of succinct automata (Q2423764) (← links)
- Formalizing Moessner's theorem and generalizations in \textsc{Nuprl} (Q2667184) (← links)
- Non-Deterministic Kleene Coalgebras (Q2786140) (← links)
- Probabilistic NetKAT (Q2802486) (← links)
- A Coalgebraic Decision Procedure for NetKAT (Q2819821) (← links)
- A Coalgebraic View of ε-Transitions (Q2848955) (← links)
- A Coalgebraic Perspective on Minimization and Determinization (Q2892759) (← links)
- A Specification Language for Reo Connectors (Q2894576) (← links)
- Brzozowski’s Algorithm (Co)Algebraically (Q2897941) (← links)
- (Q2908856) (← links)
- Trace Semantics via Determinization (Q2914679) (← links)
- Left-Handed Completeness (Q2915142) (← links)
- Brzozowski’s and Up-To Algorithms for Must Testing (Q2937778) (← links)
- How to Kill Epsilons with a Dagger (Q2942775) (← links)
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence (Q2946691) (← links)
- A coalgebraic view on decorated traces (Q2973240) (← links)
- A Decision Procedure for Bisimilarity of Generalized Regular Expressions (Q2999323) (← links)
- Final Semantics for Decorated Traces (Q3178274) (← links)
- Deriving Syntax and Axioms for Quantitative Regular Behaviours (Q3184671) (← links)
- Towards a Coalgebraic Chomsky Hierarchy (Q3190167) (← links)
- Nominal Kleene Coalgebra (Q3449483) (← links)
- Completeness and Incompleteness in Nominal Kleene Algebra (Q3460616) (← links)
- Behavioural Differential Equations and Coinduction for Binary Trees (Q3612670) (← links)
- A Kleene Theorem for Polynomial Coalgebras (Q3617725) (← links)
