What is he best known for?
The fields of study he is best known for:
- Programming language
- Algebra
- Real number
Jan Rutten mainly focuses on Coalgebra, Coinduction, Programming language, Algebra and Bisimulation.
His Coinduction study is focused on Mathematical proof in general.
Jan Rutten works mostly in the field of Programming language, limiting it down to concerns involving Theoretical computer science and, occasionally, Component and Well-founded semantics.
Algebra and Discrete mathematics are commonly linked in his work.
His biological study spans a wide range of topics, including Automata theory and Homomorphism.
His Homomorphism research includes elements of Variety and Universal algebra.
His most cited work include:
- Universal coalgebra: a theory of systems (1037 citations)
- Modeling component connectors in Reo by constraint automata (300 citations)
- Solving reflexive domain equations in a category of complete metric spaces (178 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Algebra, Coalgebra, Discrete mathematics, Coinduction and Automaton.
His Algebra study incorporates themes from Finite-state machine, Regular expression, Bisimulation and Automata theory.
Coalgebra is the subject of his research, which falls under Pure mathematics.
His Discrete mathematics study combines topics from a wide range of disciplines, such as Variety, Deterministic automaton, Reachability and Metric.
His studies in Coinduction integrate themes in fields like Function, Formal power series, Calculus and Formal language.
Jan Rutten has included themes like Equivalence, Programming language and Algorithm in his Automaton study.
He most often published in these fields:
- Algebra (37.33%)
- Coalgebra (33.64%)
- Discrete mathematics (32.26%)
What were the highlights of his more recent work (between 2011-2019)?
- Algebra (37.33%)
- Coalgebra (33.64%)
- Equivalence (18.43%)
In recent papers he was focusing on the following fields of study:
His primary areas of study are Algebra, Coalgebra, Equivalence, Automaton and Discrete mathematics.
His Algebra research is multidisciplinary, relying on both Operational semantics and Nondeterministic algorithm.
His Coalgebra study is concerned with the larger field of Pure mathematics.
The various areas that Jan Rutten examines in his Equivalence study include Programming language, Concurrency, Equivalence, Mathematical proof and Algorithm.
His work carried out in the field of Mathematical proof brings together such families of science as Regular expression, Bisimulation, Theoretical computer science and Kleene star.
His Automaton research incorporates elements of Functor, Coinduction and Congruence relation.
Between 2011 and 2019, his most popular works were:
- Generalizing determinization from automata to coalgebras (99 citations)
- Algebra-coalgebra duality in brzozowski's minimization algorithm (49 citations)
- A coalgebraic perspective on linear weighted automata (44 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algebra
- Real number
Jan Rutten mainly focuses on Coalgebra, Algebra, Discrete mathematics, Equivalence and Coinduction.
His studies deal with areas such as Duality, Correctness and Reachability as well as Coalgebra.
His primary area of study in Algebra is in the field of Formal power series.
His Discrete mathematics study integrates concerns from other disciplines, such as ω-automaton, Deterministic automaton, Universal algebra and Automata theory.
His Equivalence study combines topics in areas such as Programming language, Bisimulation, Automaton, Mathematical proof and Cable gland.
His Coinduction research incorporates themes from Theoretical computer science, Subtyping, Tree, Pure mathematics and Set.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
