The following pages link to Jan J. M. M. Rutten (Q919833):
Displaying 50 items.
- Varieties and covarieties of languages (extended abstract) (Q265785) (← links)
- A coalgebraic perspective on linear weighted automata (Q418134) (← links)
- Connectors as designs: modeling, refinement and test case generation (Q433336) (← links)
- The dual equivalence of equations and coequations for automata (Q498397) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- Complete sets of cooperations (Q618169) (← links)
- (Q672054) (redirect page) (← links)
- Elements of generalized ultrametric domain theory (Q672055) (← links)
- Solving reflexive domain equations in a category of complete metric spaces (Q753944) (← links)
- Proving language inclusion and equivalence by coinduction (Q899321) (← links)
- Denotational semantics of a parallel object-oriented language (Q910250) (← links)
- Contractions in comparing concurrency semantics (Q919834) (← links)
- A coinductive calculus of binary trees (Q964505) (← links)
- Generalized metric spaces: Completion, topology, and powerdomains via the Yoneda embedding (Q1127524) (← links)
- Semantic models for concurrent logic languages (Q1177921) (← links)
- A layered semantics for a parallel object-oriented language (Q1194208) (← links)
- From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic (Q1194328) (← links)
- Weighted colimits and formal balls in generalized metric spaces (Q1295210) (← links)
- Fully abstract denotational models for nonuniform concurrent languages (Q1341758) (← links)
- A transition system semantics for the control-driven coordination language MANIFOLD (Q1575145) (← links)
- Universal coalgebra: A theory of systems (Q1583483) (← links)
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series (Q1884876) (← links)
- A proof of Moessner's theorem by coinduction (Q1929334) (← links)
- Bisimulation for probabilistic transition systems: A coalgebraic approach (Q1960528) (← links)
- Context-free coalgebras (Q2341705) (← links)
- Modeling component connectors in Reo by constraint automata (Q2495551) (← links)
- A tutorial on coinductive stream calculus and signal flow graphs (Q2571208) (← links)
- Non-deterministic Kleene coalgebras (Q2786140) (← links)
- Coalgebraic Semantics of Heavy-Weighted Automata (Q2787337) (← links)
- Newton Series, Coinductively (Q2787418) (← links)
- Coinductive counting: bisimulation in enumerative combinatorics (extended abstract) (Q2842562) (← links)
- Coalgebraic characterizations of context-free languages (Q2848359) (← links)
- Synthesis of Mealy machines using derivatives (Q2863892) (← links)
- Observational coalgebras and complete sets of co-operations (Q2873667) (← links)
- Intentional Automata: A Context-Dependent Model for Component Connectors (Q2894573) (← links)
- Brzozowski’s Algorithm (Co)Algebraically (Q2897941) (← links)
- On the Final Coalgebra of Automatic Sequences (Q2897949) (← links)
- Generalizing the powerset construction, coalgebraically (Q2908856) (← links)
- Defining Context-Free Power Series Coalgebraically (Q2914674) (← links)
- Coalgebraic Bisimulation-Up-To (Q2927660) (← links)
- Regular Varieties of Automata and Coequations (Q2941177) (← links)
- Equations and Coequations for Weighted Automata (Q2946360) (← links)
- A coalgebraic view on decorated traces (Q2973240) (← links)
- (Q2980965) (← links)
- A Decision Procedure for Bisimilarity of Generalized Regular Expressions (Q2999323) (← links)
- Context-Free Languages, Coalgebraically (Q3090880) (← links)
- Final Semantics for Decorated Traces (Q3178274) (← links)
- Deriving Syntax and Axioms for Quantitative Regular Behaviours (Q3184671) (← links)
- Semantic Correctness for a Parallel Object-Oriented Language (Q3474904) (← links)
- A Roman Senator (Q3507405) (← links)
